Affiliation:
1. Department of Mathematics and Theoretical Informatics, Faculty of Electrical Engineering and Informatics, Technical University of Košice, 042 00 Košice, Slovakia
Abstract
The crossing number of a graph is a significant measure that indicates the complexity of the graph and the difficulty of visualizing it. In this paper, we examine the crossing numbers of join products involving the complete graph K5 with discrete graphs, paths, and cycles. We analyze optimal drawings of K5, identify all five non-isomorphic drawings, and address previously hypothesized crossing numbers for K5+Pn, and K5+Cn. Through a simplified approach, we first establish cr(K5+Dn) and then extend our method to prove the crossing numbers cr(K5+Pn) and cr(K5+Cn). These results also lead to new hypotheses for cr(Wm+Sn) and cr(Wm+Wn) involving wheels and stars. Our findings correct previous inaccuracies in the literature and provide a foundation for future research.
Funder
Slovak Research and Development Agency
Scientific Grant Agency
Reference32 articles.
1. A survey of graphs with known or bounded crossing numbers;Clancy;Australas. J. Combin.,2020
2. Schaefer, M. (2024). The Graph Crossing Number and its Variants: A Survey. Electron. J. Comb., 20, Available online: https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS21/pdf.
3. Aichholzer, O., Fabila-Monroy, R., Fuchs, A., Hidalgo-Toscano, C., Parada, I., Vogtenhuber, B., and Zaragoza, F. (2019, January 17–20). On the 2-Colored Crossing Number. Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization, Lecture Notes in Computer Science, SEP, Prague, Czech Republic.
4. The crossing number of K5,n;Kleitman;J. Comb. Theory,1970
5. West, D.B. (2011). Introduction to Graph Theory, Prentice Hall.