On minimum algebraic connectivity of graphs whose complements are bicyclic
From MaRDI portal
Publication:2111720
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
Cites work
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Consensus and Cooperation in Networked Multi-Agent Systems
- Distributed Robust Synchronization of Dynamical Networks With Stochastic Coupling
- Eigenspaces of graphs
- Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges
- Minimizing algebraic connectivity over connected graphs with fixed girth
- Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles
- On the second minimum algebraic connectivity of the graphs whose complements are trees
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
- The Laplacian Spectrum of a Graph
- The Laplacian Spectrum of a Graph II
- The algebraic connectivity of lollipop graphs
- 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
Cited in
(6)- Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles
- The 2-extra connectivity of wheel networks
- The smallest values of algebraic connectivity for unicyclic graphs
- Minimizing algebraic connectivity over connected graphs with fixed girth
- On graphs with algebraic connectivity equal to minimum edge density
- Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs
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)