On mean distance in certain classes of graphs

DOI10.1002/net.3230190405zbMath0671.05047OpenAlexW2114545144MaRDI QIDQ3824444

George R. T. Hendry

Publication date: 1989

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230190405

zbMATH Keywords

extremal graphsmean distanceself-complementary graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (3)

Computing the average distance of an interval graph ⋮ On mean distance and girth ⋮ On the average order of a dominating set of a forest

This page was built for publication: On mean distance in certain classes of graphs