  For a graph G, M(G) denotes the maximum multiplicity occurring of an
eigenvalue of a symmetric matrix whose zero-nonzero pattern is given by edges
of G. We introduce two combinatorial graph parameters T^-(G) and T^+(G) that
give a lower and an upper bound for M(G) respectively, and we show that these
bounds are sharp.
