The ordering of trees and connected graphs by algebraic connectivity
From MaRDI portal
Publication:2477524
DOI10.1016/j.laa.2007.08.031zbMath1134.05063OpenAlexW2073136022MaRDI QIDQ2477524
Hai-Ying Shan, Ji-Ming Guo, Jia-yu Shao
Publication date: 14 March 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2007.08.031
Related Items (23)
A lower bound for the algebraic connectivity of a graph in terms of the domination number ⋮ On algebraic connectivity of graphs with at most two points of articulation in each block ⋮ The algebraic connectivity of graphs with given circumference ⋮ The algebraic connectivity of graphs with given matching number ⋮ Edge perturbation on graphs with clusters: adjacency, Laplacian and signless Laplacian eigenvalues ⋮ Unnamed Item ⋮ The smallest values of algebraic connectivity for unicyclic graphs ⋮ The smallest values of algebraic connectivity for trees ⋮ The smallest Laplacian spectral radius of graphs with a given clique number ⋮ On the spectral moments of unicyclic graphs with fixed diameter ⋮ Algebraic connectivity of connected graphs with fixed number of pendant vertices ⋮ On two conjectures of spectral graph theory ⋮ On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ Algebraic connectivity and degree sequences of trees ⋮ Conjectures on index and algebraic connectivity of graphs ⋮ On the multiplicity of laplacian eigenvalues of graphs ⋮ Graphs with clusters perturbed by regular graphs -- \(A_\alpha \)-spectrum and applications ⋮ Algebraic connectivity on a subclass of caterpillars ⋮ The ordering of unicyclic graphs with the smallest algebraic connectivity ⋮ On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering ⋮ The effect on Aα-eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters ⋮ Finite-time consensus for multi-agent systems with nonlinear dynamics under Euler digraph via pinning control
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Permanental roots and the star degree of a graph
- The algebraic connectivity of graphs under perturbation
- Inertia characteristics of self-adjoint matrix polynomials
- Laplacian graph eigenvectors
- Laplacian matrices of graphs: A survey
- On the second largest Laplacian eigenvalue of trees
- The Laplacian Spectrum of a Graph
- Eigenvalues of the Laplacian of a graph∗
- Algebraic connectivity and the characteristic set of a graph
- Ordering trees by algebraic connectivity
This page was built for publication: The ordering of trees and connected graphs by algebraic connectivity
