About the type of broom trees

DOI10.1007/s40314-023-02497-2OpenAlexW4388999324MaRDI QIDQ6184800

Daniel Felisberto Traciná Filho, Claudia Marcela Justel

Publication date: 5 January 2024

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-023-02497-2

zbMATH Keywords

Fiedler vectorbottleneck matrixBroom treestype of trees

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the largest eigenvalues of trees with perfect matchings
• Permanent of the Laplacian matrix of trees and bipartite graphs
• On the minimal energy of trees with a given diameter
• A survey of automated conjectures in spectral graph theory
• Perron values and classes of trees
• Characteristic vertices of weighted trees via perron values
• Maximizing the distance between center, centroid and characteristic set of a tree
• Extremizing algebraic connectivity subject to graph theoretic constraints
• On the characteristic set, centroid, and centre for a tree
• Constructions for type I trees with nonisomorphic Perron branches
• Different central parts of trees and their pairwise distances
• Characteristic vertices of trees^*
• Ordering trees by algebraic connectivity

This page was built for publication: About the type of broom trees