EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

The Crossing Numbers of Join Products of All 5-Vertex Graphs with Discrete Graphs, Paths and Cycles

Jana Fortes, Mária Timková

Mathematics · 14.07.2026 · 14 (14) · 2528

DOI: 10.3390/math14142528 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 14.07.2026. Verfasst von Jana Fortes und 1 weiteren Autor:innen. Die Arbeit nennt 42 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Slovak Research and Development Agency, Scientific Grant Agency of the Ministry of Education, Research, Development and Youth of the Slovak Republic and the Slovak Academy of Sciences, Slovakia’s Recovery and Resilience Plan under Contract.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper investigates crossing numbers of join products involving all non-isomorphic graphs of order five and the graph families Dn, Pn, and Cn. By systematically examining all 34 graphs of order five, we establish a unified classification of 102 crossing number values together with the corresponding references and principal proof techniques. The collected results consolidate previously scattered contributions, clarify several inconsistencies in the literature, and identify the unique remaining unresolved case. For the graph H57, we verify the conjectured crossing numbers computationally for all feasible values n≤5, establish general upper bounds, and prove that the corresponding results for joins with paths and cycles follow directly from the discrete graph case. Consequently, determining the exact crossing numbers of H57 is reduced to establishing the corresponding lower bounds for joins with discrete graphs. The resulting classification reveals that the crossing number values are governed by only a small number of recurring formula types, suggesting that the crossing behaviour of join products involving graphs of order five is determined primarily by a limited collection of fundamental structural patterns.

Förderung

  • Slovak Research and Development Agency
  • Scientific Grant Agency of the Ministry of Education, Research, Development and Youth of the Slovak Republic and the Slovak Academy of Sciences
  • Slovakia’s Recovery and Resilience Plan under Contract

Zitieren

APA

Fortes, J., & Timková, M. (2026). The Crossing Numbers of Join Products of All 5-Vertex Graphs with Discrete Graphs, Paths and Cycles. Mathematics, 14(14), 2528. https://doi.org/10.3390/math14142528

Vancouver

Fortes J, Timková M. The Crossing Numbers of Join Products of All 5-Vertex Graphs with Discrete Graphs, Paths and Cycles. Mathematics. 2026;14(14):2528. doi:10.3390/math14142528

BibTeX
@article{Fortes2026,
  author = {Fortes, Jana and Timková, Mária},
  title = {The Crossing Numbers of Join Products of All 5-Vertex Graphs with Discrete Graphs, Paths and Cycles},
  journal = {Mathematics},
  year = {2026},
  volume = {14},
  number = {14},
  pages = {2528},
  doi = {10.3390/math14142528}
}
Kostenlos starten →