<p>Our purpose is to identify the graphs that are “fundamental” for the maximum multiplicity problem for Hermitian matrices with a given undirected simple graph. Like paths for trees, these are the special graphs to which the maximum multiplicity problem may be reduced. These are the graphs for which maximum multiplicity implies that all vertices are downers. Examples include cycles and complete graphs, and several more are identified, using the theory developed herein. All the unicyclic graphs that are fundamental, are explicitly identified. We also list those graphs with two edges added to a tree, and their maximum multiplicities, which we have found so far to be fundamental. A formula for maximum multiplicity is given based on fundamental graphs.</p>