We prove that all $1$-vertex spatial graphs with adequate diagrams have minimal crossing number, and that spatial graph diagrams obtained by replacing vertices and edges of a planar embedded graph by minimal crossing link or spatial graph diagrams have minimal crossing number. Finally, we give an example in answer to a question of Adams et al. about minimal crossing diagrams of rigid vertex graphs.