Abstract | ||
---|---|---|
Using Ore's structural characterization on diameter- maximal graphs, we determine the extremal graphs with the minimum average distance among the graphs with given order and diameter, thereby solving a conjecture of Aouchiche and Hansen [Automated results and conjectures on average distance in graphs, in Graph Theory in Paris, eds. A. Bondy, J. Fonlupt, J.-L. Fouquet, J.-C. Fournier and J.-L. Ramirez Alfonsin, Trends in Mathematics, Vol. 6 (Birkhauser Boston, Boston, 2007), pp. 21-36]. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1142/S1793830911001255 | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS |
Keywords | Field | DocType |
Diameter, average distance, Wiener index | Graph theory,Odd graph,Graph,Discrete mathematics,Combinatorics,Wiener index,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
3 | 3 | 1793-8309 |
Citations | PageRank | References |
1 | 0.37 | 4 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Baoyindureng Wu | 1 | 99 | 24.68 |
Guojie Liu | 2 | 3 | 0.76 |
Xinhui An | 3 | 18 | 5.55 |
Guiying Yan | 4 | 196 | 22.92 |
Xiaoping Liu | 5 | 1 | 0.37 |