scientific article; zbMATH DE number 1123762

From MaRDI portal
Publication:4379732





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.











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)