A CONJECTURE ON AVERAGE DISTANCE AND DIAMETER OF A GRAPH

DOI10.1142/S1793830911001255zbMath1242.05084WikidataQ123125442 ScholiaQ123125442MaRDI QIDQ2890990

Xinhui An, Guojie Liu, Baoyindureng Wu, Xiao-Ping Liu, Gui Ying Yan

Publication date: 12 June 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

diameterWiener indexaverage distance

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Cites Work

• Diameter of 4-colourable graphs
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Wiener index of hexagonal systems
• Using minimum degree to bound average distance
• Wiener index for graphs and their line graphs with arbitrary large cyclomatic numbers
• Mean distance and minimum degree
• Diameters in graphs
• Wiener index of trees: Theory and applications

This page was built for publication: A CONJECTURE ON AVERAGE DISTANCE AND DIAMETER OF A GRAPH