Calculating Crossing Numbers of Graphs Using Combinatorial Principles

Zhenhua Su and Kamal Kumar

Mathematical Problems in Engineering, 2022, vol. 2022, 1-8

Abstract: 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.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/mpe/2022/4550953.pdf (application/pdf)
http://downloads.hindawi.com/journals/mpe/2022/4550953.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:4550953

DOI: 10.1155/2022/4550953

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().