TY - JOUR A2 - Kumar, Kamal AU - Su, Zhenhua PY - 2022 DA - 2022/06/07 TI - Calculating Crossing Numbers of Graphs Using Combinatorial Principles SP - 4550953 VL - 2022 AB - The crossing numbers of graphs were started from Turán’s brick factory problem (TBFP). Because of its wide range of applications, it has been used in computer networks, electrical circuits, and biological engineering. Recently, many experts began to pay much attention to the crossing number of G\e, which obtained from graph G by deleting an edge e. In this paper, by using some combinatorial skills, we determine the exact value of crossing numbers of K1,4,n\e and K2,3,n\e. These results are an in-depth work of TBFP, which will be beneficial to the further study of crossing numbers and its applications. SN - 1024-123X UR - https://doi.org/10.1155/2022/4550953 DO - 10.1155/2022/4550953 JF - Mathematical Problems in Engineering PB - Hindawi KW - ER -