On the second minimizing graph in the set of complements of trees
From MaRDI portal
Publication:2176151
DOI10.1016/J.AKCEJ.2018.11.005zbMATH Open1439.05052OpenAlexW2904968428WikidataQ128785075 ScholiaQ128785075MaRDI QIDQ2176151FDOQ2176151
Authors: Yanyan Li
Publication date: 4 May 2020
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2018.11.005
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
- Title not available (Why is that?)
- Graphs for which the least eigenvalue is minimal. I
- Graphs for which the least eigenvalue is minimal. II.
- 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
- Sharp lower bounds of the least eigenvalue of planar graphs
- Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
- Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
Cited In (1)
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)