Spanning trees with many leaves and average distance
From MaRDI portal
(Redirected from Publication:1010741)
Recommendations
Cited in
(31)- An asymptotic resolution of a problem of Plesník
- Wiener index of graphs with radius two
- Average distance and maximum induced forest
- The extremal average distance of cubic graphs
- Lower bounds on the leaf number in graphs with forbidden subgraphs
- On the total distance and diameter of graphs
- Average distance and connected domination
- Leaf number and Hamiltonian \(C_4\)-free graphs
- Average distance in weighted graphs
- Spanning trees with leaf distance at least four
- Spanning trees with leaf distance at least \(d\)
- On eccentric distance sum and degree distance of graphs
- Comparative results and bounds for the eccentric-adjacency index
- Further results on the Merrifield-Simmons index
- Minimum degree, leaf number and traceability.
- Spanning paths in graphs
- Selected topics on Wiener index
- Spanning trees with many leaves
- On maximum Wiener index of trees and graphs with given radius
- Average distance, independence number, and spanning trees
- Graphs with forbidden subgraphs and leaf number
- On spanning cycles, paths and trees
- scientific article; zbMATH DE number 2170329 (Why is no real title available?)
- Relationships between some distance-based topological indices
- Average distance and generalised packing in graphs
- Connected domination
- scientific article; zbMATH DE number 1743972 (Why is no real title available?)
- On minimum degree, leaf number, traceability and Hamiltonicity in graphs
- Graphs with a given diameter that maximise the Wiener index
- Bounds on the leaf number in graphs of girth 4 or 5
- Further results on the total monochromatic connectivity of graphs
This page was built for publication: Spanning trees with many leaves and average distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010741)
