Characterization of the minimizing graph of the connected graphs whose complements are bicyclic

DOI10.3390/math5010018zbMath1365.05176OpenAlexW2595433249MaRDI QIDQ2358245

Muhammad Javaid

Publication date: 22 June 2017

Published in: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/math5010018

zbMATH Keywords

adjacency matrixleast eigenvaluebicyclic graphs

Mathematics Subject Classification ID

Extremal set theory (05D05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles, On the second minimizing graph in the set of complements of trees, Least eigenvalue of the connected graphs whose complements are cacti

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Further results on the least eigenvalue of connected graphs
• 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
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• Sharp lower bounds of the least eigenvalue of planar graphs
• Some new bounds on the spectral radius of graphs
• On the spectral radius of graphs with cut vertices
• The least eigenvalue of graphs whose complements are unicyclic
• Extremal unicyclic and bicyclic graphs with respect to Harary index
• Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
• The largest eigenvalue of a graph: A survey