No label defined (Q4379732)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1123762
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1123762 |
Statements
22 June 1998
0 references
pancyclic
0 references
subpancyclic
0 references
Hamiltonian
0 references
line graph
0 references
0.8839525580406189
0 references
0.8808079957962036
0 references
0.8804194331169128
0 references
0.8641610741615295
0 references
0.8584834337234497
0 references
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.
0 references