Average distance in colored graphs

DOI10.1002/jgt.1020zbMath0991.05038OpenAlexW4233740959MaRDI QIDQ2746481

Wayne Goddard, Peter Dankelmann, Peter J. Slater

Publication date: 28 August 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.1020

zbMATH Keywords

average distancecolored distance

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items

On the intercluster distance of a tree metric ⋮ MAD trees and distance-hereditary graphs ⋮ Partition distance in graphs ⋮ A linear-time algorithm to compute a MAD tree of an interval graph

Cites Work

• Minimean Location of Different Facilities on a Line Network
• A new characterization of tree medians with applications to distributed sorting
• Mean distance and minimum degree
• Average distance, minimum degree, and spanning trees