The distance spectrum of the complements of graphs of diameter greater than three

DOI10.1007/s13226-022-00315-9zbMath1527.05049arXiv2010.02760OpenAlexW4292603366MaRDI QIDQ6067731

No author found.

Publication date: 14 December 2023

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.02760

zbMATH Keywords

diameterdistance matrixdistance spectral radiuscomplements of graphsleast distance eigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Cites Work

• On the maximal distance spectral radius of graphs without a pendent vertex
• The least eigenvalue of the complements of trees
• Distance spectral radius of trees with given matching number
• The least signless Laplacian eignvalue of the complements of unicyclic graphs
• The distance spectrum of complements of trees
• The distance eigenvalues of the complements of unicyclic graphs
• Distance spectra of graphs: a survey
• The least eigenvalue of graphs whose complements have only two pendent vertices
• On the least distance eigenvalue and its applications on the distance spread
• The least eigenvalue of the signless Laplacian of the complements of trees
• Distance spectral radius of trees with fixed number of pendent vertices
• On the least distance eigenvalue of a graph
• On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs

This page was built for publication: The distance spectrum of the complements of graphs of diameter greater than three