Sign in
Back
Some spectral sufficient conditions for a graph being pancyclic
Journal article   Open access  Peer reviewed

Some spectral sufficient conditions for a graph being pancyclic

Huan Xu, Tao Yu, Fawaz E. Alsaadi, Madini Obad Alassafi, Guidong Yu, Jinde Cao and 1 Department of Public Education, Hefei Preschool Education College, Hefei 230013, China
AIMS mathematics, Vol.5(6), pp.5389-5401
01/01/2020
DOI: https://doi.org/10.3934/math.2020346

Abstract

Mathematics Mathematics, Applied Physical Sciences Science & Technology
Let G(V, E) be a simple connected graph of order n. A graph of order n is called pancyclic if it contains all the cycles C-k for k is an element of (3, 4, ...,n). In this paper, some new spectral sufficient conditions for the graph to be pancyclic are established in terms of the edge number, the spectral radius and the signless Laplacian spectral radius of the graph.
url
https://doi.org/10.3934/math.2020346View
Published (Version of record) Open

Metrics

1 Record Views

Details