Edge-diameter of a graph and its longest cycles
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\).
- A degree sum condition with connectivity for relative length of longest paths and cycles
- A note on distance-dominating cycles
- A result on Hamiltonian line graphs involving restrictions on induced subgraphs
- Circumference of a graph and its distance dominating longest cycles
- Existence of dominating cycles and paths
- Existence of Δλ-cycles and Δλ-paths
- Forbidden pairs and the existence of a dominating cycle
- Graph theory
- scientific article; zbMATH DE number 3570494 (Why is no real title available?)
- scientific article; zbMATH DE number 3353327 (Why is no real title available?)
- On the circumference of 3-connected graphs
- On the line graph of a graph with diameter 2
- Some Theorems on Abstract Graphs
This page was built for publication: Edge-diameter of a graph and its longest cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133658)
