Absolute algebraic connectivity of double brooms and trees
From MaRDI portal
Publication:908315
DOI10.1016/j.dam.2015.08.009zbMath1329.05174OpenAlexW1246609183MaRDI QIDQ908315
Sebastian Richter, Israel Rocha
Publication date: 4 February 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.08.009
Related Items (2)
Spectral Bounds for the Connectivity of Regular Graphs with Given Order ⋮ Augmenting the algebraic connectivity for certain families of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On ordering bicyclic graphs with respect to the Laplacian spectral radius
- Old and new results on algebraic connectivity of graphs
- Ordering trees with nearly perfect matchings by algebraic connectivity
- Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues
- On the minimal energy ordering of trees with perfect matchings
- Some results on the Laplacian eigenvalues of unicyclic graphs
- Ordering of the trees with a perfect matching by minimal energies
- Ordering graphs with small index and its application
- The smallest values of algebraic connectivity for trees
- Ordering trees and graphs with few cycles by algebraic connectivity
- Laplacian energy of diameter 3 trees
- On the sum of the Laplacian eigenvalues of a tree
- Characterizing trees with large Laplacian energy
- Ordering trees by their Laplacian spectral radii
- On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs
- Embedded in the Shadow of the Separator
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Absolute algebraic connectivity of trees
- Ordering trees by algebraic connectivity
- Ordering trees by their largest eigenvalues
- Ordering trees by algebraic connectivity
- Ordering trees by their largest eigenvalues
This page was built for publication: Absolute algebraic connectivity of double brooms and trees
