Pages that link to "Item:Q3439834"
From MaRDI portal
The following pages link to Maximizing the distance between center, centroid and characteristic set of a tree (Q3439834):
Displaying 7 items.
- Algebraic connectivity of connected graphs with fixed number of pendant vertices (Q659677) (← links)
- Maximizing distance between center, centroid and subtree core of trees (Q1713074) (← links)
- A conjecture on different central parts of binary trees (Q2102762) (← links)
- Trees with matrix weights: Laplacian matrix and characteristic-like vertices (Q2134567) (← links)
- Fiedler vector analysis for particular cases of connected graphs (Q5862623) (← links)
- Different central parts of trees and their pairwise distances (Q5887650) (← links)
- About the type of broom trees (Q6184800) (← links)
