Distance Laplacian eigenvalues and chromatic number in graphs
From MaRDI portal
Publication:5157458
DOI10.2298/FIL1709545AzbMath1488.05291WikidataQ130139535 ScholiaQ130139535MaRDI QIDQ5157458
Mustapha Aouchiche, Pierre Hansen
Publication date: 18 October 2021
Published in: Filomat (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items
NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS, On spectral spread of generalized distance matrix of a graph, Some inequalities involving the distance signless Laplacian eigenvalues of graphs, On autographix conjecture regarding domination number and average eccentricity, Sharp bounds for spectral radius of Dα-matrix of graphs, On graphs with distance Laplacian eigenvalues of multiplicity n −4, On the second largest eigenvalue of the generalized distance matrix of graphs, Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity, DISTANCE LAPLACIAN SPECTRUM OF THE COMMUTING GRAPH OF FINITE CA-GROUPS, On the spectrum of an equitable quotient matrix and its application, On distance Laplacian spectral radius and chromatic number of graphs, On distance Laplacian and distance signless Laplacian eigenvalues of graphs, Distance Laplacian spectra of various graph operations and its application to graphs on algebraic structures
Uses Software
Cites Work
- Two Laplacians for the distance matrix of a graph
- New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
- On the distance Laplacian spectra of graphs
- The chromatic number and the least eigenvalue of a graph
- The smallest eigenvalue of the signless Laplacian
- On the extremal values of the second largest \(Q\)-eigenvalue
- Signless Laplacian spectral radii of graphs with given chromatic number
- Spectra of graphs
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Lower bounds for the clique and the chromatic numbers of a graph
- Spectral radii of graphs with given chromatic number
- Signless Laplacians of finite graphs
- Unified spectral bounds on the chromatic number
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Bounds and conjectures for the signless Laplacian index of graphs
- Chromatic number and spectral radius
- Recent results in the theory of graph spectra
- Laplacian matrices of graphs: A survey
- Bounds of eigenvalues of a graph
- Interlacing eigenvalues and graphs
- A survey of Nordhaus-Gaddum type relations
- A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Distance spectra of graphs: a survey
- On the distance Laplacian spectral radius of bipartite graphs
- On the distance Laplacian spectral radius of graphs
- Bounds on graph eigenvalues. II
- LAPLACIAN SPECTRA AND CHROMATIC NUBERS OF GRAPHS
- Some Inequalities for the Largest Eigenvalue of a Graph
- On Complementary Graphs
- Eigenvalue bounds for the signless laplacian
- Towards a spectral theory of graphs based on the signless Laplacian, I
- Towards a spectral theory of graphs based on the signless Laplacian, III
- On spectral radius of the distance matrix
- Some properties of the distance Laplacian eigenvalues of a graph
- The Eigenvalues of a Graph and Its Chromatic Number
- ON EIGENVALUES AND COLORINGS OF GRAPHS, II
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
