{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:39:24Z","timestamp":1760236764604,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T00:00:00Z","timestamp":1639699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main purpose of this paper is to determine the crossing numbers of the join products of six symmetric graphs on six vertices with paths and cycles on n vertices. The idea of configurations is generalized for the first time onto the family of subgraphs whose edges cross the edges of the considered graph at most once, and their lower bounds of necessary numbers of crossings are presented in the common symmetric table. Some proofs of the join products with cycles are done with the help of several well-known auxiliary statements, the idea of which is extended by a suitable classification of subgraphs that do not cross the edges of the examined graphs.<\/jats:p>","DOI":"10.3390\/sym13122441","type":"journal-article","created":{"date-parts":[[2021,12,20]],"date-time":"2021-12-20T02:40:32Z","timestamp":1639968032000},"page":"2441","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the Crossing Numbers of the Join Products of Six Graphs of Order Six with Paths and Cycles"],"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":"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":[[2021,12,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1016\/j.disc.2009.08.018","article-title":"The crossing numbers of join of the special graph on six vertices with path and cycle","volume":"310","year":"2010","journal-title":"Discret. Math."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.dam.2009.09.002","article-title":"Crossing minimization in extended level drawings of graphs","volume":"158","author":"Bachmaier","year":"2010","journal-title":"Discret. Applied Math."},{"key":"ref_3","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_4","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. Comb."},{"key":"ref_5","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_6","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."},{"key":"ref_7","unstructured":"Kle\u0161\u010d, M. (2019, January 5\u20137). The crossing numbers of join of cycles with graphs of order four. Proceedings of the 18th Conference on Applied Mathematics, Bratislava, Slovakia."},{"key":"ref_8","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_9","unstructured":"Dra\u017eensk\u00e1, E. (2019, January 25\u201328). On the crossing number of join of graph of order six with path. Proceedings of the 22nd Czech-Japan Seminar on Data Analysis and Decision Making, Nov\u00fd Sv\u011btlov, Czechia."},{"key":"ref_10","unstructured":"Dra\u017eensk\u00e1, E. (2019, January 11\u201313). Crossing numbers of join product of several graphs on 6 vertices with path using cyclic permutation. Proceedings of the 37th International Conference, \u010cesk\u00e9 Bud\u011bjovice, Czechia."},{"key":"ref_11","first-page":"522","article-title":"The crossing numbers of join of special graphs","volume":"2","year":"2011","journal-title":"Electr. Eng. Inform."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/978-3-642-28212-6_15","article-title":"The crossing numbers of join of paths and cycles with two graphs of order five","volume":"Volume 7125","year":"2012","journal-title":"Lecture Notes in Computer Science: Mathematical Modeling and Computational Science"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"27","DOI":"10.15546\/aeei-2017-0023","article-title":"On the crossing number of the join of five vertex graph G with the discrete graph Dn","volume":"17","author":"Valo","year":"2017","journal-title":"Acta Electrotech. Inform."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"351","DOI":"10.7151\/dmgt.2005","article-title":"The Crossing Number of Join of the Generalized Petersen Graph P(3, 1) with Path and Cycle","volume":"38","author":"Ouyang","year":"2018","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Sta\u0161, M. (2020). Join Products K2,3+Cn. Mathematics, 8.","DOI":"10.3390\/math8060925"},{"key":"ref_16","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_17","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":"Opusc. Math."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Kle\u0161\u010d, M., and Sta\u0161, M. (2020). Cyclic permutations in determining crossing numbers. Discuss. Math. Graph Theory, to appear.","DOI":"10.7151\/dmgt.2351"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.37193\/CJM.2019.02.02","article-title":"Cyclic permutations and crossing numbers of join products of two symmetric graphs of order six","volume":"35","year":"2019","journal-title":"Carpathian J. Math."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Sta\u0161, M. (2019). Determining crossing number of join of the discrete graph with two symmetric graphs of order five. Symmetry, 11.","DOI":"10.3390\/sym11020123"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1017\/S000497271800059X","article-title":"Determining crossing numbers of graphs of order six using cyclic permutations","volume":"98","year":"2018","journal-title":"Bull. Aust. Math. Soc."},{"key":"ref_22","unstructured":"Sta\u0161, M. (2018, January 6\u20138). Cyclic permutations: Crossing numbers of the join products of graphs. Proceedings of the 17th Conference on Applied Mathematics, Bratislava, Slovakia."},{"key":"ref_23","first-page":"29","article-title":"The optimal drawing of K5,n","volume":"21","author":"Medina","year":"2014","journal-title":"Electron. J. Comb."},{"key":"ref_24","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_25","first-page":"1","article-title":"Algorithm of the Cyclic-Order Graph Program (Implementation and Usage)","volume":"7","year":"2019","journal-title":"J. Math. Model. Geom."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"143","DOI":"10.37193\/CJM.2018.02.03","article-title":"Cyclic permutations and crossing numbers of join products of symmetric graph of order six","volume":"34","year":"2018","journal-title":"Carpathian J. Math."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"583","DOI":"10.7151\/dmgt.1705","article-title":"On the crossing numbers of Cartesian products of stars and graphs of order six","volume":"33","year":"2013","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"399","DOI":"10.7151\/dmgt.1957","article-title":"On the crossing numbers of Cartesian products of wheels and trees","volume":"37","author":"Valo","year":"2017","journal-title":"Discuss. Math. Graph Theory"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/12\/2441\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:50:42Z","timestamp":1760169042000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/12\/2441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,17]]},"references-count":28,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2021,12]]}},"alternative-id":["sym13122441"],"URL":"https:\/\/doi.org\/10.3390\/sym13122441","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2021,12,17]]}}}