Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles

DOI10.1080/09720529.2019.1668144zbMath1485.05090OpenAlexW3006073059MaRDI QIDQ5034967

Cao, Jinde, Muhammad Javaid, Masood Ur Rehman, Mohsin Raza, Wen Chean Teh

Publication date: 21 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2019.1668144

zbMATH Keywords

Laplacian matrixalgebraic connectivitybicyclic graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (1)

On minimum algebraic connectivity of graphs whose complements are bicyclic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Signless Laplacian spectral characterization of the cones over some regular graphs
• The orderings of bicyclic graphs and connected graphs by algebraic connectivity
• The algebraic connectivity of lollipop graphs
• The ordering of unicyclic graphs with the smallest algebraic connectivity
• Minimizing algebraic connectivity over connected graphs with fixed girth
• On the second minimum algebraic connectivity of the graphs whose complements are trees
• The least algebraic connectivity of graphs
• Spectral radius of bipartite graphs
• Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
• The minimum algebraic connectivity of caterpillar unicyclic graphs
• The Laplacian Spectrum of a Graph
• The Laplacian Spectrum of a Graph II
• Consensus and Cooperation in Networked Multi-Agent Systems
• Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
• Some properties of Laplacian eigenvectors
• Distributed Robust Synchronization of Dynamical Networks With Stochastic Coupling
• Which multicone graphs are determined by their signless Laplacian spectrum? (The proof of a conjecture)
• Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
• Synchronization in scale-free dynamical networks: robustness and fragility
• The Laplacian spectrum of corona of two graphs

This page was built for publication: Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles