Spanning trees with many leaves and average distance

zbMATH Open1181.05052MaRDI QIDQ1010741FDOQ1010741

Authors: 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 (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Average distance, independence number, and spanning trees
• Average distance and maximum induced forest
• scientific article; zbMATH DE number 5037210
• scientific article; zbMATH DE number 508964
• Bounds of the number of leaves of spanning trees

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (31)

• Selected topics on Wiener index
• On eccentric distance sum and degree distance of graphs
• Spanning paths in graphs
• Minimum degree, leaf number and traceability.
• Average distance and generalised packing in graphs
• Title not available (Why is that?)
• Graphs with a given diameter that maximise the Wiener index
• On spanning cycles, paths and trees
• An asymptotic resolution of a problem of Plesník
• Average distance and maximum induced forest
• Title not available (Why is that?)
• On maximum Wiener index of trees and graphs with given radius
• Spanning trees with leaf distance at least four
• Spanning trees with many leaves
• On the total distance and diameter of graphs
• Average distance and connected domination
• Bounds on the leaf number in graphs of girth 4 or 5
• The extremal average distance of cubic graphs
• Further results on the total monochromatic connectivity of graphs
• Average distance in weighted graphs
• Lower bounds on the leaf number in graphs with forbidden subgraphs
• Spanning trees with leaf distance at least \(d\)
• Average distance, independence number, and spanning trees
• Wiener index of graphs with radius two
• Relationships between some distance-based topological indices
• Leaf number and Hamiltonian \(C_4\)-free graphs
• On minimum degree, leaf number, traceability and Hamiltonicity in graphs
• Comparative results and bounds for the eccentric-adjacency index
• Further results on the Merrifield-Simmons index
• Connected domination
• Graphs with forbidden subgraphs and leaf number

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)