Join Products K 2,3 + C n

Michal Staš
Additional contact information
Michal Staš: Faculty of Electrical Engineering and Informatics, Technical University of Košice, 042 00 Košice, Slovakia

Mathematics, 2020, vol. 8, issue 6, 1-9

Abstract: The crossing number cr ( G ) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main goal of the paper is to state the crossing number of the join product K 2 , 3 + C n for the complete bipartite graph K 2 , 3 , where C n is the cycle on n vertices. In the proofs, the idea of a minimum number of crossings between two distinct configurations in the various forms of arithmetic means will be extended. Finally, adding one more edge to the graph K 2 , 3 , we also offer the crossing number of the join product of one other graph with the cycle C n .

Keywords: graph; join product; crossing number; cyclic permutation; arithmetic mean (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/8/6/925/pdf (application/pdf)
https://www.mdpi.com/2227-7390/8/6/925/ (text/html)

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:gam:jmathe:v:8:y:2020:i:6:p:925-:d:368016

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().