The ordering of trees and connected graphs by algebraic connectivity
From MaRDI portal
Publication:2477524
Recommendations
Cites work
- Algebraic connectivity and the characteristic set of a graph
- Eigenvalues of the Laplacian of a graph∗
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Inertia characteristics of self-adjoint matrix polynomials
- Laplacian graph eigenvectors
- Laplacian matrices of graphs: A survey
- On the second largest Laplacian eigenvalue of trees
- Ordering trees by algebraic connectivity
- Permanental roots and the star degree of a graph
- The algebraic connectivity of graphs under perturbation
- The Laplacian Spectrum of a Graph
Cited in
(36)- 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
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
- On two conjectures of spectral graph theory
- The smallest values of algebraic connectivity for trees
- Ordering trees and graphs with few cycles by algebraic connectivity
- Graphs with clusters perturbed by regular graphs -- \(A_\alpha \)-spectrum and applications
- Ordering trees with algebraic connectivity and diameter
- The six classes of trees with the largest algebraic connectivity
- The algebraic connectivity of graphs with given circumference
- The algebraic connectivity of graphs with given matching number
- Algebraic connectivity on a subclass of caterpillars
- On algebraic connectivity of graphs with at most two points of articulation in each block
- On the multiplicity of laplacian eigenvalues of graphs
- Edge perturbation on graphs with clusters: adjacency, Laplacian and signless Laplacian eigenvalues
- scientific article; zbMATH DE number 5732677 (Why is no real title available?)
- scientific article; zbMATH DE number 27961 (Why is no real title available?)
- The smallest Laplacian spectral radius of graphs with a given clique number
- On the spectral moments of unicyclic graphs with fixed diameter
- Finite-time consensus for multi-agent systems with nonlinear dynamics under Euler digraph via pinning control
- Effects on the distance Laplacian spectrum of graphs with clusters by adding edges
- scientific article; zbMATH DE number 6274853 (Why is no real title available?)
- On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph.
- The effect on Aα-eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters
- Ordering trees by algebraic connectivity
- Ordering trees by algebraic connectivity
- The smallest values of algebraic connectivity for unicyclic graphs
- The orderings of bicyclic graphs and connected graphs by algebraic connectivity
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- On the algebraic connectivity of token graphs and graphs under perturbations
- Some observations on algebraic connectivity of graphs
- The algebraic connectivity of graphs with given induced matching number
- Conjectures on index and algebraic connectivity of graphs
- The algebraic connectivity of unicyclic digraphs
- Cubic bipartite graphs with minimum spectral gap
- Algebraic connectivity and degree sequences of trees
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)
