Minimizing graph of the connected graphs whose complements are bicyclic with two cycles

DOI10.3906/mat-1608-6zbMath1424.05185OpenAlexW2769219841MaRDI QIDQ4633701

Muhammad Javaid

Publication date: 3 May 2019

Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3906/mat-1608-6

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) Connectivity (05C40)

Related Items (4)

Characterization of the minimizing graph of the connected graphs whose complements are bicyclic ⋮ 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
• Further results on the least eigenvalue of connected graphs
• The least eigenvalue of the complements of trees
• 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 graphs with given connectivity
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• Sharp lower bounds of the least eigenvalue of planar graphs
• The least eigenvalue of graphs whose complements are unicyclic
• The largest eigenvalue of a graph: A survey

This page was built for publication: Minimizing graph of the connected graphs whose complements are bicyclic with two cycles