On minimum algebraic connectivity of graphs whose complements are bicyclic
From MaRDI portal
Publication:2111720
DOI10.1515/math-2019-0119OpenAlexW2995285877MaRDI QIDQ2111720
Mohsin Raza, Jia-Bao Liu, Muhammad Javaid, Naeem Saleem
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-0119
Extremal set theory (05D05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algebraic connectivity of lollipop graphs
- 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
- The least eigenvalue of the signless Laplacian of the complements of trees
- 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
- Distributed Robust Synchronization of Dynamical Networks With Stochastic Coupling
- Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
- Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges
This page was built for publication: On minimum algebraic connectivity of graphs whose complements are bicyclic