The distance spectrum of the complements of graphs with two pendent vertices
From MaRDI portal
Publication:6089320
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
Cites work
- Distance spectra of graphs: a survey
- Distance spectral radius of trees with fixed number of pendent vertices
- Distance spectral radius of trees with given matching number
- On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
- On the least distance eigenvalue and its applications on the distance spread
- On the least distance eigenvalue of a graph
- On the maximal distance spectral radius of graphs without a pendent vertex
- The distance eigenvalues of the complements of unicyclic graphs
- The distance spectrum of complements of trees
- The least eigenvalue of graphs whose complements have only two pendent vertices
- The least eigenvalue of the complements of trees
- The least eigenvalue of the signless Laplacian of the complements of trees
- The least signless Laplacian eignvalue of the complements of unicyclic graphs
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)