Pages that link to "Item:Q5521316"
From MaRDI portal
The following pages link to The Eigenvalues of a Graph and Its Chromatic Number (Q5521316):
Displaying 15 items.
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
- (Q3879256) (← links)
- On colouring random graphs (Q4050627) (← links)
- The largest eigenvalue of a graph: A survey (Q4713877) (← links)
- On the maximum spectral radius of multipartite graphs (Q4956176) (← links)
- NEW UPPER BOUND ON THE LARGEST LAPLACIAN EIGENVALUE OF GRAPHS (Q5010151) (← links)
- Spectral Inequalities on Independence Number, Chromatic Number, and Total Chromatic Number of a Graph (Q5069684) (← links)
- Chromatic number and signless Laplacian spectral radius of graphs (Q5104011) (← links)
- Technical Note—Revenue Volatility Under Uncertain Network Effects (Q5106368) (← links)
- Distance Laplacian eigenvalues and chromatic number in graphs (Q5157458) (← links)
- Graph theory (Q5917392) (← links)
- Spectral graph theory via higher order eigenvalues and applications to the analysis of random walks (Q5963354) (← links)
- New eigenvalue bound for the fractional chromatic number (Q6201030) (← links)
- Inverse of Hermitian adjacency matrix of mixed bipartite graphs (Q6616833) (← links)
- Spectral upper bounds for the Grundy number of a graph (Q6658056) (← links)
