Improvement of Sufficient Conditions for Pancyclic Graphs
Scientific Journal of Technology · 22.01.2024 · 6 (1) · 29-32
DOI: 10.54691/w10e3408 ↗Kurz gefasst
Fachartikel in der Zeitschrift Scientific Journal of Technology, online erschienen am 22.01.2024. Verfasst von Xingxing Wang und 4 weiteren Autor:innen. Die Arbeit nennt 9 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
The study of cyclic graphs has always been a hot topic in the field of graph theory and has received widespread attention from graph theory practitioners. If an n-order graph G exactly contains cycles of all lengths from 3 to n, then the graph is called a pan cycle graph. This article proves that, after excluding some special cases, when the number of edges in graph G is greater than or equal to C2n-3+12, graph G must be a pan cyclic graph.
Zitieren
APA
Wang, X., Li, M., Shi, W., Wu, Y., & Zhao, Y. (2024). Improvement of Sufficient Conditions for Pancyclic Graphs. Scientific Journal of Technology, 6(1), 29-32. https://doi.org/10.54691/w10e3408
Vancouver
Wang X, Li M, Shi W, Wu Y, Zhao Y. Improvement of Sufficient Conditions for Pancyclic Graphs. Scientific Journal of Technology. 2024;6(1):29-32. doi:10.54691/w10e3408
BibTeX
@article{Wang2024,
author = {Wang, Xingxing and Li, Mengjie and Shi, Wenxue and Wu, Yue and Zhao, Yuting},
title = {Improvement of Sufficient Conditions for Pancyclic Graphs},
journal = {Scientific Journal of Technology},
year = {2024},
volume = {6},
number = {1},
pages = {29--32},
doi = {10.54691/w10e3408}
}
EUVIMED