Some Sufficient Conditions on Pancyclic Graphs

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.

References in corpus (3)

• Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
• Spectral conditions for a graph to be Hamilton-connected
• Spectral Condition for a Graph to be Hamiltonian with respect to Normalized Laplacian

Cited by in corpus (1)

• Spectral Conditions for the Bipancyclic Bipartite Graphs