Least eigenvalue of the connected graphs whose complements are cacti
From MaRDI portal
Publication:2111705
Cites Work
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- A sufficient condition for the existence of a \(k\)-factor excluding a given \(r\)-factor
- Bicyclic graphs for which the least eigenvalue is minimum
- Bicyclic graphs with maximum sum of the two largest Laplacian eigenvalues
- Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
- 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.
- Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
- Odd mean labeling for two star graph
- On the least eigenvalue of cacti
- On the second minimizing graph in the set of complements of trees
- On the sum of the two largest Laplacian eigenvalues of trees
- 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
- Sharp lower bounds of the least eigenvalue of planar graphs
- Spectral properties of a class of unicyclic graphs
- Spektren endlicher Grafen
- 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
- \((\beta, \alpha)\)-connectivity index of graphs
Cited In (2)
This page was built for publication: Least eigenvalue of the connected graphs whose complements are cacti
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111705)
