The ordering of trees and connected graphs by algebraic connectivity
From MaRDI portal
Publication:2477524
DOI10.1016/J.LAA.2007.08.031zbMATH Open1134.05063OpenAlexW2073136022MaRDI QIDQ2477524
Hai-Ying Shan, Jia-Yu Shao, Jiming Guo
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inertia characteristics of self-adjoint matrix polynomials
- Eigenvalues of the Laplacian of a graph∗
- Laplacian matrices of graphs: A survey
- On the second largest Laplacian eigenvalue of trees
- The Laplacian Spectrum of a Graph
- Laplacian graph eigenvectors
- Permanental roots and the star degree of a graph
- Algebraic connectivity and the characteristic set of a graph
- Ordering trees by algebraic connectivity
- The algebraic connectivity of graphs under perturbation
Cited In (28)
- The effect on Aα-eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters
- Title not available (Why is that?)
- Ordering trees with algebraic connectivity and diameter
- Finite-time consensus for multi-agent systems with nonlinear dynamics under Euler digraph via pinning control
- The six classes of trees with the largest algebraic connectivity
- Algebraic connectivity and degree sequences of trees
- On two conjectures of spectral graph theory
- The algebraic connectivity of graphs with given circumference
- Title not available (Why is that?)
- The smallest Laplacian spectral radius of graphs with a given clique number
- On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
- On the spectral moments of unicyclic graphs with fixed diameter
- Title not available (Why is that?)
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- Algebraic connectivity on a subclass of caterpillars
- Title not available (Why is that?)
- The ordering of unicyclic graphs with the smallest algebraic connectivity
- The smallest values of algebraic connectivity for unicyclic graphs
- Edge perturbation on graphs with clusters: adjacency, Laplacian and signless Laplacian eigenvalues
- Conjectures on index and algebraic connectivity of graphs
- The smallest values of algebraic connectivity for trees
- On algebraic connectivity of graphs with at most two points of articulation in each block
- Ordering trees and graphs with few cycles by algebraic connectivity
- On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph
- The algebraic connectivity of graphs with given matching number
- Graphs with clusters perturbed by regular graphs -- \(A_\alpha \)-spectrum and applications
- On the multiplicity of laplacian eigenvalues of graphs
This page was built for publication: The ordering of trees and connected graphs by algebraic connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477524)