Edge Growth in Graph Cubes

We show that for every connected graph G of diameter 3, the graph G3 has average degree 7 4 (G). We also provide an example showing that this bound is best possible. This resolves a question of Hegarty [3].

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Matt DeVos, Stéphan Thomassé
• Keywords: Connected Graph, CORR 2010, Education, Graph G3