Pages that link to "Item:Q2459973"
From MaRDI portal
The following pages link to Ordering trees with algebraic connectivity and diameter (Q2459973):
Displaying 11 items.
- 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)
- Trees with matrix weights: Laplacian matrix and characteristic-like vertices (Q2134567) (← 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)
- The algebraic connectivity of graphs with given matching number (Q2637744) (← links)
- Algebraic connectivity on a subclass of caterpillars (Q2840700) (← links)
- On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph (Q5408244) (← links)
- Ordering trees by algebraic connectivity (Q5891552) (← links)
- The algebraic connectivity of barbell graphs (Q6542048) (← links)
- Effects on the algebraic connectivity of weighted graphs under edge rotations (Q6635258) (← links)
