scientific article; zbMATH DE number 1123762
A simple graph \(\Gamma\) is said to be subpancyclic if it contains an (elementary) circuit of length \(k\) for every integer \(k\in[3,\text{cr}(\Gamma)]\), where \(\text{cr}(\Gamma)\) denotes the length of a longest circuit in \(\Gamma\). If \(\text{cr}(\Gamma)=|V(\Gamma)|\), then \(\Gamma\) is said to be pancyclic. Let \(L(\Gamma)\) denote the derived (or line) graph of \(\Gamma\) and let \(\delta_1(\Gamma)\) denote the minimum sum of the valences of any pair of adjacent vertices. The main result is the following: Let \(\Gamma\) be a graph of order \(n\geq 600\) such that \(\delta_1(\Gamma)^2-\delta_1(\Gamma)>2n\). Then \(L(\Gamma)\) is subpancyclic. In a corollary the author shows that under the same hypotheses, if \(L(\Gamma)\) is Hamiltonian then it is pancyclic, and the inequality involving \(\delta_1\) is as sharp as possible.
- A note on cycle spectra of line graphs
- On pancyclic line graphs
- Pancyclicity of claw-free Hamiltonian graphs
- Line graphs and forbidden induced subgraphs
- Subpancyclicity of line graphs and degree sums along paths
- A characterization of pancyclic complements of line graphs
- scientific article; zbMATH DE number 3914367 (Why is no real title available?)
- scientific article; zbMATH DE number 4033797 (Why is no real title available?)
- scientific article; zbMATH DE number 4043880 (Why is no real title available?)
- scientific article; zbMATH DE number 19192 (Why is no real title available?)
- scientific article; zbMATH DE number 1215015 (Why is no real title available?)
- Degree sums and subpancyclicity in line graphs
- Radius and subpancyclicity in line graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4379732)