On minimum algebraic connectivity of graphs whose complements are bicyclic

DOI10.1515/MATH-2019-0119OpenAlexW2995285877MaRDI QIDQ2111720FDOQ2111720

Authors: Jiabao Liu, M. Javaid, Mohsin Raza, 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

Recommendations

• Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles
• On the algebraic connectivity of bicyclic graphs
• Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
• Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
• The algebraic connectivity of a graph and its complement
• A note on the algebraic connectivity of a graph and its complement
• The minimum algebraic connectivity of graphs with a given clique number
• On the second minimum algebraic connectivity of the graphs whose complements are trees
• On graphs with algebraic connectivity equal to minimum edge density
• On the lower bound of the sum of the algebraic connectivity of a graph and its complement

zbMATH Keywords

eigenvaluesLaplacian matrixalgebraic connectivity

Mathematics Subject Classification ID

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

Cites Work

• The Laplacian Spectrum of a Graph II
• Title not available (Why is that?)
• Eigenspaces of graphs
• Consensus and Cooperation in Networked Multi-Agent Systems
• Title not available (Why is that?)
• The Laplacian Spectrum of a Graph
• Minimizing algebraic connectivity over connected graphs with fixed girth
• Distributed Robust Synchronization of Dynamical Networks With Stochastic Coupling
• The least eigenvalue of the signless Laplacian of the complements of trees
• Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
• The least algebraic connectivity of graphs
• The minimum algebraic connectivity of caterpillar unicyclic graphs
• The algebraic connectivity of lollipop graphs
• Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges
• On the second minimum algebraic connectivity of the graphs whose complements are trees
• Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles

Cited In (6)

• On graphs with algebraic connectivity equal to minimum edge density
• Minimizing algebraic connectivity over connected graphs with fixed girth
• Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs
• The smallest values of algebraic connectivity for unicyclic graphs
• Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles
• The 2-extra connectivity of wheel networks

This page was built for publication: On minimum algebraic connectivity of graphs whose complements are bicyclic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111720)