The distance spectrum of the complements of graphs with two pendent vertices
From MaRDI portal
Publication:6089320
DOI10.1007/S13226-022-00322-WzbMATH Open1527.05050OpenAlexW4296679228MaRDI QIDQ6089320FDOQ6089320
Authors:
Publication date: 14 December 2023
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13226-022-00322-w
Recommendations
- The distance spectrum of the complements of graphs of diameter greater than three
- The distance spectrum of complements of trees
- Distance spectral radius of the complements of trees with fixed parameters
- The least eigenvalue of graphs whose complements have only two pendent vertices
- On the distance spectrum of graphs
distance matrixdistance spectral radiusleast distance eigenvaluependent verticescomplements of graphs
Cites Work
- Distance spectra of graphs: a survey
- On the least distance eigenvalue and its applications on the distance spread
- Distance spectral radius of trees with given matching number
- On the least distance eigenvalue of a graph
- On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
- On the maximal distance spectral radius of graphs without a pendent vertex
- The least eigenvalue of the signless Laplacian of the complements of trees
- The least eigenvalue of the complements of trees
- Distance spectral radius of trees with fixed number of pendent vertices
- 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
- The least eigenvalue of graphs whose complements have only two pendent vertices
Cited In (1)
This page was built for publication: The distance spectrum of the complements of graphs with two pendent vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089320)
