{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:12:34Z","timestamp":1760145154508,"version":"build-2065373602"},"reference-count":32,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T00:00:00Z","timestamp":1719273600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100005357","name":"Slovak Research and Development Agency","doi-asserted-by":"publisher","award":["APVV-22-0400","1\/0413\/22"],"award-info":[{"award-number":["APVV-22-0400","1\/0413\/22"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Scientific Grant Agency (VEGA)","award":["APVV-22-0400","1\/0413\/22"],"award-info":[{"award-number":["APVV-22-0400","1\/0413\/22"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/axioms13070427","type":"journal-article","created":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T09:29:33Z","timestamp":1719394173000},"page":"427","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["From the Crossing Numbers of K5 + Pn and K5 + Cn to the Crossing Numbers of Wm + Sn and Wm + Wn"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2837-8879","authenticated-orcid":false,"given":"Michal","family":"Sta\u0161","sequence":"first","affiliation":[{"name":"Department of Mathematics and Theoretical Informatics, Faculty of Electrical Engineering and Informatics, Technical University of Ko\u0161ice, 042 00 Ko\u0161ice, Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5154-9293","authenticated-orcid":false,"given":"Jana","family":"Fortes","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Theoretical Informatics, Faculty of Electrical Engineering and Informatics, Technical University of Ko\u0161ice, 042 00 Ko\u0161ice, Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u00e1ria","family":"\u0160vecov\u00e1","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Theoretical Informatics, Faculty of Electrical Engineering and Informatics, Technical University of Ko\u0161ice, 042 00 Ko\u0161ice, Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,6,25]]},"reference":[{"key":"ref_1","first-page":"209","article-title":"A survey of graphs with known or bounded crossing numbers","volume":"78","author":"Clancy","year":"2020","journal-title":"Australas. J. Combin."},{"key":"ref_2","unstructured":"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."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Fabila-Monroy, R., Fuchs, A., Hidalgo-Toscano, C., Parada, I., Vogtenhuber, B., and Zaragoza, F. (2019, January 17\u201320). 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.","DOI":"10.1007\/978-3-030-35802-0_7"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0021-9800(70)80087-4","article-title":"The crossing number of K5,n","volume":"9","author":"Kleitman","year":"1970","journal-title":"J. Comb. Theory"},{"key":"ref_5","unstructured":"West, D.B. (2011). Introduction to Graph Theory, Prentice Hall."},{"key":"ref_6","first-page":"331","article-title":"The crossing numbers of K5 + Pn","volume":"38","author":"Su","year":"2018","journal-title":"J. Math. Res. App."},{"key":"ref_7","first-page":"445","article-title":"The crossing number of K5 \u00d7 Sn","volume":"28","author":"Huang","year":"2008","journal-title":"J. Math. Res. Exp."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Yang, X., Bian, H., Yu, H., and Liu, D. (2022). The Local Antimagic Total Chromatic Number of Some Wheel-Related Graphs. Axioms, 11.","DOI":"10.3390\/axioms11030097"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.disopt.2007.05.006","article-title":"A Branch-and-Cut Approach to the Crossing Number Problem","volume":"5","author":"Buchheim","year":"2008","journal-title":"Discret. Optim."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"4.1","DOI":"10.1145\/1498698.1564504","article-title":"Experiments on Exact Crossing Minimization using Column Generation","volume":"14","author":"Chimani","year":"2009","journal-title":"ACM J. Exp. Algorithmics"},{"key":"ref_11","unstructured":"Chimani, M., and Wiedera, T. (2016, January 22\u201324). An ILP-based proof system for the crossing number problem. Proceedings of the 24th Annual European Symposium on Algorithms (ESA 2016), Aarhus, Denmark."},{"key":"ref_12","unstructured":"(2024, June 19). Crossing Number Web Compute. Available online: http:\/\/crossings.uos.de\/."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","article-title":"Crossing number is NP-complete","volume":"4","author":"Garey","year":"1983","journal-title":"SIAM J. Algebraic. Discret. Methods"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1016\/j.disc.2009.08.018","article-title":"The crossing number of join of the special graph on six vertices with path and cycle","volume":"310","year":"2010","journal-title":"Discrete Math."},{"key":"ref_15","first-page":"461","article-title":"The crossing number of K1,1,3,n","volume":"99","author":"Ho","year":"2011","journal-title":"ARS Comb."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"P4.1","DOI":"10.37236\/2777","article-title":"The optimal drawing of K5,n","volume":"21","author":"Medina","year":"2014","journal-title":"Electron. J. Combin."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1002\/jgt.3190170602","article-title":"Cyclic-order graphs and Zarankiewicz\u2019s crossing number conjecture","volume":"17","author":"Woodall","year":"1993","journal-title":"J. Graph Theory"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"321","DOI":"10.7151\/dmgt.1548","article-title":"The crossing numbers of join products of paths with graphs of order four","volume":"31","year":"2011","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"865","DOI":"10.7494\/OpMath.2023.43.6.865","article-title":"The crossing numbers of join products of four graphs of order five with paths and cycles","volume":"43","year":"2023","journal-title":"Opuscula Math."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Guy, R.K. (1972). Crossing numbers of graphs. Graph Theory and Applications, Springer. 303 of Lecture Notes in Mathematics.","DOI":"10.1007\/BFb0067363"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s00373-007-0726-z","article-title":"On the crossing number of Km\u25a1Pn","volume":"23","author":"Zheng","year":"2007","journal-title":"Graphs Combin."},{"key":"ref_22","first-page":"1163","article-title":"Cyclic permutations in determining crossing numbers","volume":"42","year":"2022","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Sta\u0161, M. (2021). The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five. Mathematics, 9.","DOI":"10.3390\/math9111277"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"381","DOI":"10.37193\/CJM.2020.03.06","article-title":"On the crossing number of join of the wheel on six vertices with the discrete graph","volume":"36","year":"2020","journal-title":"Carpathian J. Math."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"95","DOI":"10.7494\/OpMath.2021.41.1.95","article-title":"On the crossing numbers of join products of W4 + Pn and W4 + Cn","volume":"41","author":"Valiska","year":"2021","journal-title":"Opuscula Math."},{"key":"ref_26","first-page":"79","article-title":"On crossing numbers of join of W4 + Cn","volume":"50","author":"Yue","year":"2014","journal-title":"Comp. Eng. Appl."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"137","DOI":"10.4064\/fm-41-1-137-145","article-title":"On a problem of P. Turan concerning graphs","volume":"41","author":"Zarankiewicz","year":"1995","journal-title":"Fundam. Math."},{"key":"ref_28","first-page":"137","article-title":"Crossing Numbers of K1,1,4,n and K1,1,4\u25a1T","volume":"148","author":"Su","year":"2020","journal-title":"ARS Comb."},{"key":"ref_29","first-page":"631","article-title":"The crossing numbers of Sm + Pn and Sm + Cn","volume":"40","author":"Wang","year":"2011","journal-title":"Adv. Math"},{"key":"ref_30","unstructured":"Sta\u0161, M., and Timkov\u00e1, M. The influence of separating cycles in drawings of K5\\e in the join product with paths and cycles, Math. Slovaca, accepted for publication."},{"key":"ref_31","unstructured":"Kle\u0161\u010d, M. (2019, January 5\u20137). The crossing numbers of join of cycles with graphs of order four. Proceedings of the APLIMAT 2019: 18th Conference on Applied Mathematics, Bratislava, Czech Republic."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.endm.2007.01.049","article-title":"The join of graphs and crossing numbers","volume":"28","year":"2007","journal-title":"Electron. Notes Discret. Math."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/7\/427\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:04:17Z","timestamp":1760108657000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/7\/427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,25]]},"references-count":32,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2024,7]]}},"alternative-id":["axioms13070427"],"URL":"https:\/\/doi.org\/10.3390\/axioms13070427","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2024,6,25]]}}}