scholarly journals On k-path pancyclic graphs

2015 ◽  
Vol 35 (2) ◽  
pp. 271
Author(s):  
Zhenming Bi ◽  
Ping Zhang
Keyword(s):  
Pancyclic Graphs

Vertex Pancyclic Graphs

1999 ◽  
Vol 3 ◽  
pp. 166-170
Author(s):  
Bert Randerath ◽  
Lutz Volkmann ◽  
Ingo Schiermeyer ◽  
Meike Tewes
Keyword(s):  
Pancyclic Graphs

scholarly journals Pancyclic graphs II

1976 ◽  
Vol 20 (1) ◽  
pp. 41-46 ◽  
Author(s):  
J.A Bondy ◽  
A.W Ingleton
Keyword(s):  
Pancyclic Graphs

scholarly journals (2)-pancyclic graphs

2013 ◽  
Vol 161 (7-8) ◽  
pp. 1128-1136 ◽  
Author(s):  
Carol T. Zamfirescu
Keyword(s):  
Pancyclic Graphs

scholarly journals Enumeration of the Edge Weights of Symmetrically Designed Graphs

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Muhammad Javaid ◽  
Hafiz Usman Afzal ◽  
Ebenezer Bonyah
Keyword(s):  
Disjoint Union ◽  
Antimagic Labeling ◽  
Pancyclic Graphs

The idea of super a , 0 -edge-antimagic labeling of graphs had been introduced by Enomoto et al. in the late nineties. This article addresses super a , 0 -edge-antimagic labeling of a biparametric family of pancyclic graphs. We also present the aforesaid labeling on the disjoint union of graphs comprising upon copies of C 4 and different trees. Several problems shall also be addressed in this article.

Uniquely Pancyclic Graphs

2016 ◽  
pp. 49-67
Author(s):  
John C. George ◽  
Abdollah Khodkar ◽  
W. D. Wallis
Keyword(s):  
Pancyclic Graphs

On the girth of hamiltonian weakly pancyclic graphs

1997 ◽  
Vol 26 (3) ◽  
pp. 165-173 ◽  
Author(s):  
B�la Bollob�s ◽  
Andrew Thomason
Keyword(s):  
Pancyclic Graphs

scholarly journals Some theorems of uniquely pancyclic graphs

1986 ◽  
Vol 59 (1-2) ◽  
pp. 167-180 ◽  
Author(s):  
Yongbing Shi
Keyword(s):  
Pancyclic Graphs

scholarly journals Spectral Sufficient Conditions on Pancyclic Graphs

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Guidong Yu ◽  
Tao Yu ◽  
Xiangwei Xia ◽  
Huan Xu
Keyword(s):  
Spectral Radius ◽  
Spectral Theory ◽  
Sufficient Conditions ◽  
Laplacian Spectral Radius ◽  
Signless Laplacian Spectral Radius ◽  
Signless Laplacian ◽  
Np Complete ◽  
Pancyclic Graphs ◽  
Theory Of Graphs ◽  
Spectrum Of Graphs

A pancyclic graph of order n is a graph with cycles of all possible lengths from 3 to n . In fact, it is NP-complete that deciding whether a graph is pancyclic. Because the spectrum of graphs is convenient to be calculated, in this study, we try to use the spectral theory of graphs to study this problem and give some sufficient conditions for a graph to be pancyclic in terms of the spectral radius and the signless Laplacian spectral radius of the graph.

Sign in / Sign up

Export Citation Format

Share Document