Bounds for the largest coclique of an undirected, simple, loopless graph on n vertices can be found dueto the interlacing of these quantities.
Bounds for the largest coclique of an undirected, simple, loopless graph on n vertices can be found dueto the interlacing of these quantities. These quantities are lowest when the Rayleigh quotient is minimized.Bounds on these quantities can be obtained using the minimax theorem of Courant and Fisher. Thesequantities lie in the union of closed discs in the complex plane according to a theorem of Gersgorin. Schurshowed that they majorize the diagonal elements of a Hermitian matrix. If A and B are m by n and n by mcomplex matrices, then AB and BA have the same nonzero value for this quantity, counting multiplicity,and, as a consequence, their traces are equal. These quantities are the zeros of the characteristic polynomial.For 10 points, identify these quantities that scale an eigenvector.
Bounds for the largest coclique of an undirected, simple, loopless graph on n vertices can be found dueto the interlacing of these quantities.
eigenvalues [or characteristic values before "characteristic polynomial" is read]