Year: 2024
Type: article
Abstract: The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main aim of this paper is to give the crossing numbers of the join products G*+Pn and G*+Cn for the connected graph G* obtained by removing one edge (incident with the dominating vertex) from the wheel W5 on six vertices, and where Pn and Cn are paths and cycles on n vertices, respectively. Finally, we also introduce four new conjectures concerning crossing numbers of the join products of Pn and Cn with Wm∖e obtained by removing one edge (of both possible types) from the wheel Wm on m+1 vertices.
Source: Mathematics
DOI: 10.3390/math12223484
Authors: Michal Staš, Mária Timková
Institution: Technical University of Košice
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,955
OpenAlex ID: W4404124619