The crossing number of K5,n+1∖e

Yuanqiu Huang and Yuxi Wang

Applied Mathematics and Computation, 2020, vol. 376, issue C

Abstract: Let K5,n+1∖e (n ≥ 0) denote the complete bipartite graph K5,n+1 with one edge deleted. In this paper, we show that the crossing number of K5,n+1∖e is n(n−1).

Keywords: Graph; Drawing; Crossing number; Complete bipartite graph (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320300448
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:376:y:2020:i:c:s0096300320300448

DOI: 10.1016/j.amc.2020.125075

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().