Ordering trees by algebraic connectivity
From MaRDI portal
Publication:5905368
DOI10.1007/BF01787574zbMath0735.05054MaRDI QIDQ5905368
Russell Merris, Robert D. Grone
Publication date: 25 June 1992
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Related Items
Perron components and algebraic connectivity for weighted graphs ⋮ Trees with matrix weights: Laplacian matrix and characteristic-like vertices ⋮ Augmenting the algebraic connectivity for certain families of graphs ⋮ The algebraic connectivity of graphs with given circumference ⋮ The algebraic connectivity of graphs with given matching number ⋮ On the second Laplacian eigenvalues of trees of odd order ⋮ Old and new results on algebraic connectivity of graphs ⋮ On the Laplacian spectral radius of a tree. ⋮ Classification of graphs by Laplacian eigenvalue distribution and independence number ⋮ About the type of broom trees ⋮ Laplacian energy of diameter 3 trees ⋮ The algebraic connectivity of lollipop graphs ⋮ Absolute algebraic connectivity of double brooms and trees ⋮ Ordering trees by algebraic connectivity ⋮ Ordering trees with nearly perfect matchings by algebraic connectivity ⋮ On the geometry and Laplacian of a graph ⋮ Diffusion bank networks and capital flows ⋮ Ordering trees with algebraic connectivity and diameter ⋮ Ordering trees by the spectral radius of Laplacian ⋮ Algebraic connectivity of weighted trees under perturbation ⋮ Combinatorial Perron parameters for trees ⋮ Laplacian eigenvalue distribution and graph parameters ⋮ On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph ⋮ On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\) ⋮ Laplace eigenvalues of graphs---a survey ⋮ The six classes of trees with the largest algebraic connectivity ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ The ordering of trees and connected graphs by algebraic connectivity ⋮ A survey of automated conjectures in spectral graph theory ⋮ On the second largest Laplacian eigenvalue of trees ⋮ On graphs whose least eigenvalue is greater than –2 ⋮ Some results on the Laplacian spectrum ⋮ A minimax-condition for the characteristic center of a tree ⋮ The algebraic connectivity of graphs under perturbation ⋮ Trees with a large Laplacian eigenvalue multiplicity ⋮ The distance spectrum of a tree ⋮ A conjecture on the algebraic connectivity of connected graphs with fixed girth ⋮ Algebraic connectivity and doubly stochastic tree matrices ⋮ On the two conjectures of Graffiti ⋮ Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues ⋮ Maximizing the algebraic connectivity for a subclass of caterpillars ⋮ Algebraic connectivity on a subclass of caterpillars ⋮ Ordering trees by the Laplacian coefficients ⋮ On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering ⋮ On a Poset of Trees II ⋮ The limit points of Laplacian spectra of graphs ⋮ Laplacian matrices of graphs: A survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Schur convex functions on the spectra of graphs
- Permanent of the Laplacian matrix of trees and bipartite graphs
- Permanental roots and the star degree of a graph
- A bound for the permanent of the Laplacian matrix
- Nonisomorphic graphs with the same t-polynomial
- Recent results in the theory of graph spectra
- Nonisomorphic trees with the same T-polynomial
- The Laplacian Spectrum of a Graph
- Eigenvalues of the Laplacian of a graph∗
- Principal subpermanents of the Laplacian matrix
- The permanent of the Laplacian matrix of a bipartite graph
- Characteristic vertices of trees*
