Least eigenvalue of the connected graphs whose complements are cacti
From MaRDI portal
Publication:2111705
DOI10.1515/math-2019-0097OpenAlexW2989604443MaRDI QIDQ2111705
Muhammad Javaid, Muhammad Jamal, Shaohui Wang, Sana Akram, Hai Ying Wang
Publication date: 17 January 2023
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2019-0097
Extremal set theory (05D05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)
Cites Work
- Unnamed Item
- On the sum of the two largest Laplacian eigenvalues of unicyclic graphs
- Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue
- Bicyclic graphs with maximum sum of the two largest Laplacian eigenvalues
- Spectral properties of a class of unicyclic graphs
- Further results on the least eigenvalue of connected graphs
- On the least eigenvalue of cacti
- The least eigenvalue of the complements of trees
- Spektren endlicher Grafen
- Graphs for which the least eigenvalue is minimal. I
- Graphs for which the least eigenvalue is minimal. II.
- Bicyclic graphs for which the least eigenvalue is minimum
- Sharp lower bounds of the least eigenvalue of planar graphs
- On the second minimizing graph in the set of complements of trees
- On the sum of the two largest Laplacian eigenvalues of trees
- The least eigenvalue of graphs whose complements are unicyclic
- Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
- A sufficient condition for the existence of a k-factor excluding a given r-factor
- (β ,α)−Connectivity Index of Graphs
- Odd mean labeling for two star graph
- Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
- The largest eigenvalue of a graph: A survey
This page was built for publication: Least eigenvalue of the connected graphs whose complements are cacti
