Results 111 to 120 of about 1,031 (124)
Pancyclic zero divisor graph over the ring $\mathbb{Z}_n[i]$
, 2018 Ravindra Kumar, Om Prakash
openalex +2 more sources
Pancyclism and small cycles in graphs
Discussiones Mathematicae Graph Theory, 1996 Evelyne Flandrin +3 more
openaire +2 more sources
Improvement of Sufficient Conditions for Pancyclic Graphs
Xingxing Wang +4 more
openalex +2 more sources
On pancyclic line graphs [PDF]
Acta Mathematicae Applicatae Sinica, 1987 In this paper, we give a best possible Ore-like condition for a graph so that its line graph is pancyclic or vertex pancyclic.
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Edge-pancyclicity of pancake graph
International Journal of Computer Mathematics: Computer Systems Theory, 2020Pancylicity was introduced by Bondy in 1971. A graph G with vertex set V ( G ) and edge set E ( G ) is pancyclic if it contains cycles of lengths l, for 3 ≤ l ≤ | V ( G ) | .
Tzu-Liang Kung +3 more
openaire +1 more source
An Implicit Degree Condition for Pancyclicity of Graphs [PDF]
Graphs and Combinatorics, 2012 Zhu, Li and Deng introduced in 1989 the definition of implicit degree of a vertex v in a graph G, denoted by id(v), by using the degrees of the vertices in its neighborhood and the second neighborhood. And they obtained sufficient conditions with implicit degrees for a graph to be hamiltonian.
Junqing Cai, Hao Li, Wantao Ning
openaire +2 more sources
Acta Mathematica Scientia, 1998
Abstract This paper shows that if G is a connected graph of order n such that σ 2 ( G ) ¯ > 2 ( n 5 - 1 ) and L(G) is hamiltonian, then, for n ≥ 43, L(G) is pancyclic. Using the result of Veldman[8] this result settles the conjecture of Benhocine, et.al[1]: Let G be a connected almost bridgeless graph of order n such ...
openaire +2 more sources
Abstract This paper shows that if G is a connected graph of order n such that σ 2 ( G ) ¯ > 2 ( n 5 - 1 ) and L(G) is hamiltonian, then, for n ≥ 43, L(G) is pancyclic. Using the result of Veldman[8] this result settles the conjecture of Benhocine, et.al[1]: Let G be a connected almost bridgeless graph of order n such ...
openaire +2 more sources
Journal of Graph Theory, 1994
AbstractLet D be an oriented graph of order n ≧ 9 and minimum degree n − 2. This paper proves that D is pancyclic if for any two vertices u and v, either uv ≅ A(D), or dD+(u) + dD−(v) ≧ n − 3.
openaire +1 more source
AbstractLet D be an oriented graph of order n ≧ 9 and minimum degree n − 2. This paper proves that D is pancyclic if for any two vertices u and v, either uv ≅ A(D), or dD+(u) + dD−(v) ≧ n − 3.
openaire +1 more source
A sufficient condition for pancyclic graphs
Information Processing Letters, 2009In 2005, Rahman and Kaykobad proved that if G is a connected graph of order n such that d(x)+d(y)+d(x,y)>=n+1 for each pair x, y of distinct nonadjacent vertices in G, where d(x,y) is the length of a shortest path between x and y in G, then G has a Hamiltonian path [Inform. Process. Lett. 94 (2005) 37-41].
Yue Lin, Kewen Zhao, Ping Zhang
openaire +2 more sources