The algebraic connectivity of graphs with given matching number
From MaRDI portal
Publication:2637744
DOI10.1007/s00373-012-1206-7zbMath1408.05086OpenAlexW2011610367MaRDI QIDQ2637744
Publication date: 14 February 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1206-7
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- Old and new results on algebraic connectivity of graphs
- Algebraic connectivity and degree sequences of trees
- Matching theory
- Minimizing algebraic connectivity over connected graphs with fixed girth
- On trees with perfect matchings
- Ordering trees with algebraic connectivity and diameter
- The ordering of trees and connected graphs by algebraic connectivity
- The Laplacian Spectrum of a Graph
- The Laplacian Spectrum of a Graph II
- Maximizing Algebraic Connectivity Over Unicyclic Graphs
- Characteristic vertices of trees*
- Ordering trees by algebraic connectivity
- On graphs with equal algebraic and vertex connectivity
This page was built for publication: The algebraic connectivity of graphs with given matching number