On the CF-Connectedness of the k-Power of Pn
Symmetry · 05.04.2026 · 18 (4) · 617
DOI: 10.3390/sym18040617 ↗Kurz gefasst
Fachartikel in der Zeitschrift Symmetry, online erschienen am 05.04.2026. Verfasst von Michal Staš. Die Arbeit nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The study of graph connectivity is a central topic in graph theory, with CF-connectedness being a specialized property of interest. A connected graph is CF-connected if, in every optimal drawing, there exists a path between every pair of vertices such that no edges cross. This paper explores the CF-connectedness of the k-power of Pn, denoted Pnk, where Pn is a path on n vertices, Pnk is a graph on the same vertex set as Pn, and an edge {u,v} exists in Pnk if the distance between u and v on Pn is at most k. The paper concludes with a controversial drawing of the graph P105 with only 16 crossings, which refutes the truth of Zheng et al.’s conjecture that the upper bound cr(Pn5)≤4n−23 holds with equality for all n≥8.
Zitieren
APA
Staš, M. (2026). On the CF-Connectedness of the k-Power of Pn. Symmetry, 18(4), 617. https://doi.org/10.3390/sym18040617
Vancouver
Staš M. On the CF-Connectedness of the k-Power of Pn. Symmetry. 2026;18(4):617. doi:10.3390/sym18040617
BibTeX
@article{Sta2026,
author = {Staš, Michal},
title = {On the CF-Connectedness of the k-Power of Pn},
journal = {Symmetry},
year = {2026},
volume = {18},
number = {4},
pages = {617},
doi = {10.3390/sym18040617}
}
EUVIMED