The extremal average distance of cubic graphs

DOI10.1002/JGT.22943zbMath1526.05039OpenAlexW4322503781MaRDI QIDQ6047959

No author found.

Publication date: 10 October 2023

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

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

zbMATH Keywords

diametercubic graphextremal graphaverage distance

Mathematics Subject Classification ID

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

Related Items (1)

Selected topics on Wiener index

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination versus independent domination in cubic graphs
• Spanning trees with many leaves and average distance
• Maximum external Wiener index of graphs
• Using minimum degree to bound average distance
• Cubic graphs that cannot be covered with four perfect matchings
• An asymptotic resolution of a problem of Plesník
• Mathematical aspects of Wiener index
• On the sum of all distances in a graph or digraph
• Independent Domination in Cubic Graphs
• Average Distance and Edge-Connectivity II
• Average Distance and Edge-Connectivity I
• Average distance and vertex-connectivity
• The average distance and the independence number
• A lower bound on the average shortest path length in regular graphs
• Mean distance and minimum degree
• Average distance, minimum degree, and spanning trees
• Average Distance, Independence Number, and Spanning Trees
• Wiener index of trees: Theory and applications
• Extremal total distance of graphs of given radius I

This page was built for publication: The extremal average distance of cubic graphs