Spanning trees with many leaves and average distance

zbMath1181.05052MaRDI QIDQ1010741

Ermelinda DeLaViña, Bill Waller

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117225

File on IPFS

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (23)

Bounds on the leaf number in graphs of girth 4 or 5 ⋮ Further results on the total monochromatic connectivity of graphs ⋮ Relationships between some distance-based topological indices ⋮ ON THE TOTAL DISTANCE AND DIAMETER OF GRAPHS ⋮ On maximum Wiener index of trees and graphs with given radius ⋮ The extremal average distance of cubic graphs ⋮ Further results on the Merrifield-Simmons index ⋮ Leaf number and Hamiltonian \(C_4\)-free graphs ⋮ Comparative results and bounds for the eccentric-adjacency index ⋮ Average distance and connected domination ⋮ An asymptotic resolution of a problem of Plesník ⋮ Wiener index of graphs with radius two ⋮ Graphs with forbidden subgraphs and leaf number ⋮ On spanning cycles, paths and trees ⋮ Average distance in weighted graphs ⋮ Spanning paths in graphs ⋮ On minimum degree, leaf number, traceability and Hamiltonicity in graphs ⋮ Graphs with a given diameter that maximise the Wiener index ⋮ Average distance and generalised packing in graphs ⋮ On eccentric distance sum and degree distance of graphs ⋮ Connected Domination ⋮ Lower bounds on the leaf number in graphs with forbidden subgraphs ⋮ Minimum degree, leaf number and traceability

This page was built for publication: Spanning trees with many leaves and average distance