Recommendations
Cites work
- A survey of automated conjectures in spectral graph theory
- Characteristic vertices of trees*
- Characteristic vertices of weighted trees via perron values
- Constructions for type I trees with nonisomorphic Perron branches
- Different central parts of trees and their pairwise distances
- Extremizing algebraic connectivity subject to graph theoretic constraints
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Maximizing the distance between center, centroid and characteristic set of a tree
- On the characteristic set, centroid, and centre for a tree
- On the largest eigenvalues of trees with perfect matchings
- On the minimal energy of trees with a given diameter
- Ordering trees by algebraic connectivity
- Permanent of the Laplacian matrix of trees and bipartite graphs
- Perron values and classes of trees
- The multiplicity of \(A_{\alpha}\)-eigenvalues of graphs
Cited in
(2)
This page was built for publication: About the type of broom trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184800)
