Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
From MaRDI portal
Publication:4633701
Recommendations
- Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
- The least eigenvalue of graphs whose complements are unicyclic
- Minimizing the least eigenvalue of bicyclic graphs with fixed diameter.
- On the second minimizing graph in the set of complements of trees
- scientific article; zbMATH DE number 6007662
Cites work
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- Bicyclic graphs for which the least eigenvalue is minimum
- Further results on the least eigenvalue of connected graphs
- Graphs for which the least eigenvalue is minimal. I
- Graphs for which the least eigenvalue is minimal. II.
- On the least eigenvalue of graphs with cut vertices
- 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 graphs with given connectivity
- The least eigenvalue of the complements of trees
- The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
Cited in
(7)- On the second minimizing graph in the set of complements of trees
- The least eigenvalue of graphs whose complements are unicyclic
- Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
- Least eigenvalue of the connected graphs whose complements are cacti
- Complete characterization of bicyclic minimal configurations
- Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles
- On minimum algebraic connectivity of graphs whose complements are bicyclic
This page was built for publication: Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633701)