Pages that link to "Item:Q5905368"
From MaRDI portal
The following pages link to Ordering trees by algebraic connectivity (Q5905368):
Displayed 47 items.
- The algebraic connectivity of lollipop graphs (Q632471) (← links)
- Laplace eigenvalues of graphs---a survey (Q686298) (← links)
- Some results on the Laplacian spectrum (Q710973) (← links)
- On the second Laplacian eigenvalues of trees of odd order (Q865409) (← links)
- Old and new results on algebraic connectivity of graphs (Q876302) (← links)
- Absolute algebraic connectivity of double brooms and trees (Q908315) (← links)
- Ordering trees with nearly perfect matchings by algebraic connectivity (Q926016) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- The algebraic connectivity of graphs under perturbation (Q989054) (← links)
- A conjecture on the algebraic connectivity of connected graphs with fixed girth (Q998451) (← links)
- Algebraic connectivity and doubly stochastic tree matrices (Q1002267) (← links)
- Ordering trees by the Laplacian coefficients (Q1039751) (← links)
- On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering (Q1044553) (← links)
- On the geometry and Laplacian of a graph (Q1174690) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- On the Laplacian spectral radius of a tree. (Q1399261) (← links)
- Augmenting the algebraic connectivity for certain families of graphs (Q1634763) (← links)
- Combinatorial Perron parameters for trees (Q1736239) (← links)
- On the two conjectures of Graffiti (Q1827512) (← links)
- The limit points of Laplacian spectra of graphs (Q1863572) (← links)
- Ordering trees by the spectral radius of Laplacian (Q1977019) (← links)
- Trees with matrix weights: Laplacian matrix and characteristic-like vertices (Q2134567) (← links)
- Diffusion bank networks and capital flows (Q2230764) (← links)
- Laplacian eigenvalue distribution and graph parameters (Q2244867) (← links)
- On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\) (Q2245762) (← links)
- Ordering trees and graphs with few cycles by algebraic connectivity (Q2250940) (← links)
- Trees with a large Laplacian eigenvalue multiplicity (Q2282787) (← links)
- Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues (Q2322883) (← links)
- Laplacian energy of diameter 3 trees (Q2430050) (← links)
- Ordering trees with algebraic connectivity and diameter (Q2459973) (← links)
- The six classes of trees with the largest algebraic connectivity (Q2476262) (← links)
- The ordering of trees and connected graphs by algebraic connectivity (Q2477524) (← links)
- On the second largest Laplacian eigenvalue of trees (Q2484395) (← links)
- The algebraic connectivity of graphs with given circumference (Q2632019) (← links)
- The algebraic connectivity of graphs with given matching number (Q2637744) (← links)
- Maximizing the algebraic connectivity for a subclass of caterpillars (Q2840516) (← links)
- Algebraic connectivity on a subclass of caterpillars (Q2840700) (← links)
- On a Poset of Trees II (Q2852613) (← links)
- The distance spectrum of a tree (Q3360888) (← links)
- Perron components and algebraic connectivity for weighted graphs (Q4253151) (← links)
- Algebraic connectivity of weighted trees under perturbation (Q4366158) (← links)
- A minimax-condition for the characteristic center of a tree (Q4942584) (← links)
- On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph (Q5408244) (← links)
- On graphs whose least eigenvalue is greater than –2 (Q5741229) (← links)
- Ordering trees by algebraic connectivity (Q5891552) (← links)
- Classification of graphs by Laplacian eigenvalue distribution and independence number (Q6140319) (← links)
- About the type of broom trees (Q6184800) (← links)