Spectral Sufficient Conditions on Pancyclic 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 prob...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/3630245 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832548918377840640 |
|---|---|
| author | Guidong Yu Tao Yu Xiangwei Xia Huan Xu |
| author_facet | Guidong Yu Tao Yu Xiangwei Xia Huan Xu |
| author_sort | Guidong Yu |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-c94c35e43dea4f6e9042117984b4d781 |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-c94c35e43dea4f6e9042117984b4d7812025-02-03T06:12:50ZengWileyComplexity1076-27871099-05262021-01-01202110.1155/2021/36302453630245Spectral Sufficient Conditions on Pancyclic GraphsGuidong Yu0Tao Yu1Xiangwei Xia2Huan Xu3School of Mathmatics and Physic, Anqing Normal University, Anqing 246133, ChinaSchool of Mathmatics and Physic, Anqing Normal University, Anqing 246133, ChinaSchool of Mathmatics and Physic, Anqing Normal University, Anqing 246133, ChinaDepartment of Public Teanching, Hefei Preschool Education College, Hefei 230013, ChinaA 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.http://dx.doi.org/10.1155/2021/3630245 |
| spellingShingle | Guidong Yu Tao Yu Xiangwei Xia Huan Xu Spectral Sufficient Conditions on Pancyclic Graphs Complexity |
| title | Spectral Sufficient Conditions on Pancyclic Graphs |
| title_full | Spectral Sufficient Conditions on Pancyclic Graphs |
| title_fullStr | Spectral Sufficient Conditions on Pancyclic Graphs |
| title_full_unstemmed | Spectral Sufficient Conditions on Pancyclic Graphs |
| title_short | Spectral Sufficient Conditions on Pancyclic Graphs |
| title_sort | spectral sufficient conditions on pancyclic graphs |
| url | http://dx.doi.org/10.1155/2021/3630245 |
| work_keys_str_mv | AT guidongyu spectralsufficientconditionsonpancyclicgraphs AT taoyu spectralsufficientconditionsonpancyclicgraphs AT xiangweixia spectralsufficientconditionsonpancyclicgraphs AT huanxu spectralsufficientconditionsonpancyclicgraphs |