Some Sufficient Conditions on Pancyclic Graphs
Combinatorics
2018-09-27 v1
Abstract
A pancyclic graph is a graph that contains cycles of all possible lengths from three up to the number of vertices in the graph. In this paper, we establish some new sufficient conditions for a graph to be pancyclic in terms of the edge number, the spectral radius and the signless Laplacian spectral radius of the graph.
Cite
@article{arxiv.1809.09897,
title = {Some Sufficient Conditions on Pancyclic Graphs},
author = {Guidong Yu and Tao Yu and Axiu Shu and Xiangwei Xia},
journal= {arXiv preprint arXiv:1809.09897},
year = {2018}
}