Different central parts of trees and their pairwise distances
From MaRDI portal
Publication:5887650
DOI10.1080/03081087.2020.1856027OpenAlexW3111588226MaRDI QIDQ5887650FDOQ5887650
Authors: Dinesh Pandey, Kamal L. Patra 
Publication date: 13 April 2023
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.02197
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- On subtrees of trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic connectivity and the characteristic set of a graph
- Characteristic vertices of trees*
- Characteristic vertices of weighted trees via perron values
- Maximizing the distance between center, centroid and characteristic set of a tree
- Another characterization of the centroid of a tree
- On different ``middle parts of a tree
- Maximizing distance between center, centroid and subtree core of trees
- On the characteristic set, centroid, and centre for a tree
Cited In (12)
- Title not available (Why is that?)
- The property of maximal eigenvectors of trees
- On the characteristic set, centroid, and centre for a tree
- On different ``middle parts of a tree
- Schur reduction of trees and extremal entries of the Fiedler vector
- About the type of broom trees
- Maximizing the distance between center, centroid and characteristic set of a tree
- Centroids to centers in trees
- A conjecture on different central parts of binary trees
- Optimal trees for functions of internal distance
- Maximally distance-unbalanced trees
- Maximizing distance between center, centroid and subtree core of trees
This page was built for publication: Different central parts of trees and their pairwise distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5887650)
