The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
type: Item
instance of: scholarly article
title: The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
zbMATH Open document ID: 0613.05038
DOI: 10.1016/0095-8956(87)90038-4
author: Abdelhamid Benhocine
author: Adam Paweł Wojda
published in: Journal of Combinatorial Theory. Series B
publication date: 1987-01-01T00:00:00Z
review text: Let n,k\(\geq 3\) and \(m\geq 2\) be integers. Denote by F(n,k,m) the family of graphs such that \(G\in F(n,k,m)\) if and only if G is m-connected graph of order n satisfying that for all vertices x, y of G, \(d(x,y)=2\Rightarrow Max(d(x),d(y))\geq k/2,\) where d(x,y) is the distance between x and y in G. \textit{G. Fan} has shown that if \(G\in F(n,k,2)\) then the circumference of G is at least Min(n,k) [J. Comb. Theory, Ser. B 37, 221-227 (1984; Zbl 0551.05048)]. In this paper, the following three results are obtained: (1) If \(G\in F(n,n-1,2)\) and \(\alpha\) (G)\(\leq n/2\), then G is Hamiltonian with some exceptions, where \(\alpha\) (G) is the independence number of G; (2) If \(G\in F(n,n,2)\) then G is pancyclic with some exceptions; (3) If \(G\in F(n,n+1,3)\) then G is Hamilton-connected. Note. The results (2) and (3) above are also obtained by the reviewer and \textit{R. Shi} in J. Syst. Sci. Math. Sci. 6, 258-262 (1986; Zbl 0608.05050).
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 3991544
zbMATH Keywords: Hamiltonian connectivity
MaRDI profile type: Publication
full work available at URL: 0095-8956(87)90038-4
OpenAlex ID: W2043193842
cites work: New sufficient conditions for cycles in graphs
description: scientific article; zbMATH DE number 3991544