On the second minimizing graph in the set of complements of trees
From MaRDI portal
Publication:2176151
Recommendations
- Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
- The least eigenvalue of the complements of trees
- Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
- The least eigenvalue of graphs whose complements have only two pendent vertices
- On the second minimum algebraic connectivity of the graphs whose complements are trees
Cites work
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
- Graphs for which the least eigenvalue is minimal. I
- Graphs for which the least eigenvalue is minimal. II.
- Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
- Sharp lower bounds of the least eigenvalue of planar graphs
- The largest eigenvalue of a graph: A survey
- The least eigenvalue of graphs whose complements are unicyclic
- The least eigenvalue of the complements of trees
Cited in
(2)
This page was built for publication: On the second minimizing graph in the set of complements of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176151)