Edge-diameter of a graph and its longest cycles (Q6133658)

The authors propose some novel insights on the connection of the longest cycle \(D\) and the edge diameter diam\(_e(G)\) in a finite, simple, and undirected graph \(G\). The first aspect studies a graph \(G\) which is not a tree, then for the longest cycle \(D\) for the distance between \(e\in E(G)\) and \(D\) \(d_G(e,D)\leq \text{diam}_e(G)-1\) holds. A stronger statement is proposed for 2-connected graphs. The second aspect studies 3-connected simple graphs \(G\) which are not \(K_4\), where the length of a cycle is bounded by the edge diameter diam\(_e(H)\geq d^\prime\). Then, \(G\) has a cycle of length \(2d^\prime+3\) and \(2d^\prime+4\) if \(d'\geq 4\).