Ordering trees and graphs with few cycles by algebraic connectivity
From MaRDI portal
Publication:2250940
DOI10.1016/j.laa.2014.06.016zbMath1295.05138OpenAlexW2031387552MaRDI QIDQ2250940
Oscar Rojo, Vilmar Trevisan, Claudia Marcela Justel, Nair Maria Maia De Abreu
Publication date: 22 July 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2014.06.016
Related Items (6)
Absolute algebraic connectivity of double brooms and trees ⋮ Unnamed Item ⋮ Combinatorial Perron parameters for trees ⋮ Vulnerability of subclasses of chordal graphs ⋮ On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\) ⋮ Finite-time consensus for multi-agent systems with nonlinear dynamics under Euler digraph via pinning control
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The influence of Miroslav Fiedler on spectral graph theory
- Ordering of trees with fixed matching number by the Laplacian coefficients
- The smallest values of algebraic connectivity for unicyclic graphs
- Graphs with given diameter maximizing the algebraic connectivity
- The orderings of bicyclic graphs and connected graphs by algebraic connectivity
- The algebraic connectivity of lollipop graphs
- On ordering bicyclic graphs with respect to the Laplacian spectral radius
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- On the ordering of trees by the Laplacian coefficients
- Trees with the seven smallest and eight greatest Harary indices
- The spectra of a graph obtained from copies of a generalized Bethe tree
- Spectral partitioning works: planar graphs and finite element meshes
- Old and new results on algebraic connectivity of graphs
- Spectra of weighted generalized Bethe trees joined at the root
- Ordering trees with nearly perfect matchings by algebraic connectivity
- Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues
- Ordering graphs with index in the interval \((2, \sqrt{2+\sqrt 5})\)
- On eigenfunctions of Markov processes on trees
- On the minimal energy ordering of trees with perfect matchings
- Spectra of generalized Bethe trees attached to a path
- Algebraic connectivity and degree sequences of trees
- The algebraic connectivity of graphs under perturbation
- A note on Fiedler vectors interpreted as graph realizations
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- Some results on the Laplacian eigenvalues of unicyclic graphs
- Ordering of the trees with a perfect matching by minimal energies
- Ordering trees by the Laplacian coefficients
- 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
- Eigenvalues, diameter, and mean distance in graphs
- Recent results in the theory of graph spectra
- On the two largest eigenvalues of trees
- A note on limit points for algebraic connectivity
- Ordering graphs with small index and its application
- Minimizing algebraic connectivity over connected graphs with fixed girth
- The smallest values of algebraic connectivity for trees
- Proof of conjectures involving algebraic connectivity of graphs
- Graphs of given order and size and minimum 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 with algebraic connectivity and diameter
- The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
- The six classes of trees with the largest algebraic connectivity
- The ordering of trees and connected graphs by algebraic connectivity
- Ordering trees by their Laplacian spectral radii
- Randić ordering of chemical trees
- Maximizing the algebraic connectivity for a subclass of caterpillars
- Algebraic connectivity on a subclass of caterpillars
- Characteristic vertices of weighted trees via perron values
- The minimum algebraic connectivity of caterpillar unicyclic graphs
- The Laplacian Spectrum of a Graph
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Extremal algebraic connectivities of certain caterpillar classes and symmetric caterpillars
- Perron components and algebraic connectivity for weighted graphs
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Maximizing Algebraic Connectivity Over Unicyclic Graphs
- Constructions for type I trees with nonisomorphic Perron branches
- Algebraic connectivity for subclasses of caterpillars
- Ordering trees by algebraic connectivity
- Ordering trees by their largest eigenvalues
- Characteristic vertices of trees*
- Ordering trees by algebraic connectivity
- Ordering trees by their largest eigenvalues
- Discrete nodal domain theorems
This page was built for publication: Ordering trees and graphs with few cycles by algebraic connectivity
