an:05321350
Zbl 1223.05166
Lili, Zhang; Eschen, Elaine; Lai, Hong-Jian; Shao, Yehong
The \(s\)-Hamiltonian index
EN
Discrete Math. 308, No. 20, 4779-4785 (2008).
00229759
2008
j
05C45
\(s\)-Hamiltonian graph; \(s\)-Hamiltonian index; divalent path; spanning Eulerian subgraph; dominating Eulerian subgraph
Summary: For integers \(k,s\) with 0\(\leqslant k\leqslant s\leqslant |V(G)|-3\), a graph \(G\) is called \(s\)-Hamiltonian if the removal of any \(k\) vertices results in a Hamiltonian graph. For a simple connected graph that is not a path, a cycle or a \(K_{1,3}\) and an integer \(s\geqslant \)0, we define \(h_s(G)= \min \{m:L^m(G)\) is \(s\)-Hamiltonian \(\}\) and \(l(G)=\max\{m:G\) has a divalent path of length \(m\) that is not both of length 2 and in a \(K_{3}\}\), where a divalent path in \(G\) is a non-closed path in \(G\) whose internal vertices have degree 2 in \(G\). We prove that \(h_s(G)\leqslant l(G)+s+1\).