Ordering trees and graphs with few cycles by algebraic connectivity

DOI10.1016/J.LAA.2014.06.016MaRDI QIDQ2250940zbMATH OpenOpenAlexFDO

Authors Claudia Justel, Oscar Rojo, Vilmar Trevisan, Nair 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

zbMATH Keywords

algebraic connectivitygraph orderingLaplacian matrixtree ordering

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• The ordering of bicyclic graphs by algebraic connectivity
• Ordering trees with algebraic connectivity and diameter
• The ordering of trees and connected graphs by algebraic connectivity
• Ordering trees by algebraic connectivity
• Ordering trees by algebraic connectivity

Cites work

• A conjecture on the algebraic connectivity of connected graphs with fixed girth
• A note on Fiedler vectors interpreted as graph realizations
• A note on limit points for algebraic connectivity
• Algebraic connectivity and degree sequences of trees
• Algebraic connectivity for subclasses of caterpillars
• Algebraic connectivity of connected graphs with fixed number of pendant vertices
• Algebraic connectivity on a subclass of caterpillars
• Characteristic vertices of trees^*
• Characteristic vertices of weighted trees via perron values
• Characterizing trees with large Laplacian energy
• Constructions for type I trees with nonisomorphic Perron branches
• Discrete nodal domain theorems
• Eigenvalues, diameter, and mean distance in graphs
• Extremal algebraic connectivities of certain caterpillar classes and symmetric caterpillars
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Graphs of given order and size and minimum algebraic connectivity
• Graphs with given diameter maximizing the algebraic connectivity
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 4208110 (Why is no real title available?)
• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Laplacian energy of diameter 3 trees
• Maximizing Algebraic Connectivity Over Unicyclic Graphs
• Maximizing the algebraic connectivity for a subclass of caterpillars
• Minimizing algebraic connectivity over connected graphs with fixed girth
• Old and new results on algebraic connectivity of graphs
• On eigenfunctions of Markov processes on trees
• On ordering bicyclic graphs with respect to the Laplacian spectral radius
• On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
• On the minimal energy ordering of trees with perfect matchings
• On the ordering of trees by the Laplacian coefficients
• On the sum of the Laplacian eigenvalues of a tree
• On the two largest eigenvalues of trees
• Ordering graphs with index in the interval \((2, \sqrt{2+\sqrt 5})\)
• Ordering graphs with small index and its application
• Ordering of the trees with a perfect matching by minimal energies
• Ordering of trees with fixed matching number by the Laplacian coefficients
• Ordering trees by algebraic connectivity
• Ordering trees by algebraic connectivity
• Ordering trees by the Laplacian coefficients
• Ordering trees by their Laplacian spectral radii
• Ordering trees by their largest eigenvalues
• Ordering trees by their largest eigenvalues
• Ordering trees with n vertices and matching number q by their largest Laplacian eigenvalues
• Ordering trees with algebraic connectivity and diameter
• Ordering trees with nearly perfect matchings by algebraic connectivity
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Perron components and algebraic connectivity for weighted graphs
• Proof of conjectures involving algebraic connectivity of graphs
• Randić ordering of chemical trees
• Recent results in the theory of graph spectra
• Some results on the Laplacian eigenvalues of unicyclic graphs
• Spectra of generalized Bethe trees attached to a path
• Spectra of weighted generalized Bethe trees joined at the root
• Spectral partitioning works: planar graphs and finite element meshes
• The algebraic connectivity of graphs under perturbation
• The algebraic connectivity of lollipop graphs
• The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
• The influence of Miroslav Fiedler on spectral graph theory
• The Laplacian Spectrum of a Graph
• The minimum algebraic connectivity of caterpillar unicyclic graphs
• The ordering of trees and connected graphs by algebraic connectivity
• The ordering of unicyclic graphs with the smallest algebraic connectivity
• The orderings of bicyclic graphs and connected graphs by algebraic connectivity
• The six classes of trees with the largest algebraic connectivity
• The smallest values of algebraic connectivity for trees
• The smallest values of algebraic connectivity for unicyclic graphs
• The spectra of a graph obtained from copies of a generalized Bethe tree
• Trees with the seven smallest and eight greatest Harary indices

Cited in

(15)

• 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}))\)
• Ordering trees with algebraic connectivity and diameter
• The ordering of trees and connected graphs by algebraic connectivity
• The ordering of bicyclic graphs by algebraic connectivity
• scientific article; zbMATH DE number 5732677 (Why is no real title available?)
• scientific article; zbMATH DE number 27961 (Why is no real title available?)
• Finite-time consensus for multi-agent systems with nonlinear dynamics under Euler digraph via pinning control
• scientific article; zbMATH DE number 7473309 (Why is no real title available?)
• Ordering trees by algebraic connectivity
• Ordering connected graphs having small degree distances
• The algebraic connectivity of barbell graphs
• The algebraic connectivity of unicyclic digraphs
• Absolute algebraic connectivity of double brooms and trees

This page was built for publication: Ordering trees and graphs with few cycles by algebraic connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250940)