Pages that link to "Item:Q996333"

The following pages link to Chromatic number and spectral radius (Q996333):

Displaying 19 items.

• Max \(k\)-cut and the smallest eigenvalue (Q286169) (← links)
• New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix (Q396873) (← links)
• Some applications of a majorization inequality due to Bapat and Sunder (Q486230) (← links)
• An inertial lower bound for the chromatic number of a graph (Q521386) (← links)
• Bounds for the extreme eigenvalues of the Laplacian and signless Laplacian of a graph (Q690608) (← 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)
• On the Laplacian spectrum of \(k\)-uniform hypergraphs (Q2085415) (← links)
• More tales of Hoffman: bounds for the vector chromatic number of a graph (Q2107750) (← links)
• Colouring the normalized Laplacian (Q2132366) (← links)
• Spectral lower bounds for the quantum chromatic number of a graph (Q2326333) (← links)
• Some relations between the eigenvalues of adjacency, Laplacian and signless Laplacian matrix of a graph (Q2345533) (← links)
• Inequalities for the extreme eigenvalues of block-partitioned Hermitian matrices with applications to spectral graph theory (Q2451220) (← links)
• Schrödinger operators with δ- and δ′-interactions on Lipschitz surfaces and chromatic numbers of associated partitions (Q2930102) (← links)
• (Q3299333) (← links)
• Chromatic number and signless Laplacian spectral radius of graphs (Q5104011) (← links)
• Distance Laplacian eigenvalues and chromatic number in graphs (Q5157458) (← links)
• New eigenvalue bound for the fractional chromatic number (Q6201030) (← links)
• An efficient eigenvalue bounding method: CFL condition revisited (Q6649125) (← links)