Pages that link to "Item:Q396873"

The following pages link to New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix (Q396873):

Displaying 19 items.

• Conjectured bounds for the sum of squares of positive eigenvalues of a graph (Q297913) (← links)
• Upper bounds for the achromatic and coloring numbers of a graph (Q516843) (← links)
• An inertial lower bound for the chromatic number of a graph (Q521386) (← links)
• On the chromatic number of a simplicial complex (Q722323) (← links)
• Proof of a conjectured lower bound on the chromatic number of a graph (Q745214) (← links)
• Unified spectral bounds on the chromatic number (Q891325) (← links)
• Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph (Q2013183) (← links)
• Eigenvalues and chromatic number of a signed graph (Q2020660) (← links)
• Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879) (← links)
• The maximum spectral radius of non-bipartite graphs forbidding short odd cycles (Q2094864) (← links)
• More tales of Hoffman: bounds for the vector chromatic number of a graph (Q2107750) (← links)
• Spectrum of signless 1-Laplacian on simplicial complexes (Q2185220) (← links)
• Spectral lower bounds for the orthogonal and projective ranks of a graph (Q2323822) (← links)
• Spectral lower bounds for the quantum chromatic number of a graph (Q2326333) (← links)
• A characterization and an application of weight-regular partitions of graphs (Q2418982) (← links)
• Positive and negative square energies of graphs (Q6114788) (← links)
• Two conjectured strengthenings of Turán's theorem (Q6141065) (← links)
• (Q6162650) (← links)
• New eigenvalue bound for the fractional chromatic number (Q6201030) (← links)