The algebraic connectivity of graphs with given stability number
From MaRDI portal
Publication:4594673
Recommendations
- The minimum algebraic connectivity of graphs with a given clique number
- Graphs of given order and size and minimum algebraic connectivity
- The algebraic connectivity of graphs with given matching number
- Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number.
- The algebraic connectivity of graphs with given circumference
Cited in
(16)- 2-connected graphs with the minimum algebraic connectivity
- scientific article; zbMATH DE number 4075093 (Why is no real title available?)
- The algebraic connectivity of graphs with given circumference
- On bounds for some graph invariants
- The minimum algebraic connectivity of graphs with a given clique number
- scientific article; zbMATH DE number 2075777 (Why is no real title available?)
- A lower bound for algebraic connectivity based on the connection-graph-stability method
- Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number.
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- scientific article; zbMATH DE number 5942896 (Why is no real title available?)
- Connectedness of graphs arising from the dual Steenrod algebra
- Hamiltonian graphs of given order and minimum algebraic connectivity
- The algebraic connectivity of graphs with given matching number
- Graphs of given order and size and minimum algebraic connectivity
- Extremal graphs with given stability number and connectivity. II
- On connectivity numbers of stable domains
This page was built for publication: The algebraic connectivity of graphs with given stability number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594673)