Distance Laplacian eigenvalues of graphs, and chromatic and independence number

DOI10.33044/REVUMA.3235zbMATH Open1545.05138MaRDI QIDQ6589660FDOQ6589660

Shariefuddin Pirzada, Saleem Anwar Khan

Publication date: 20 August 2024

Published in: Revista de la Unión Matemática Argentina (Search for Journal in Brave)

zbMATH Keywords

chromatic numberdiameterindependence numberdistance Laplacian matrixdistance Laplacian eigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Cites Work

• An introduction to the theory of graph spectra
• Two Laplacians for the distance matrix of a graph
• The Laplacian Spectrum of a Graph
• A relation between the matching number and Laplacian spectrum of a graph
• On graphs having domination number half their order
• Title not available (Why is that?)
• Some properties of the distance Laplacian eigenvalues of a graph
• Laplacian eigenvalue distribution and graph parameters
• Domination number and Laplacian eigenvalue distribution
• Laplacian distribution and domination
• On the Sum of Distance Laplacian Eigenvalues of Graphs
• Distance Laplacian eigenvalues and chromatic number in graphs
• On distance Laplacian spectral radius and chromatic number of graphs
• The Laplacian spectrum of corona of two graphs

Cited In (1)

• Distance Laplacian spectra of graphs: a survey

This page was built for publication: Distance Laplacian eigenvalues of graphs, and chromatic and independence number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589660)