The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five

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

Mathematics, 2021, vol. 9, issue 11, 1-13

Abstract: The main aim of the paper is to establish the crossing numbers of the join products of the paths and the cycles on n vertices with a connected graph on five vertices isomorphic to the graph K 1 , 1 , 3 \ e obtained by removing one edge e incident with some vertex of order two from the complete tripartite graph K 1 , 1 , 3 . The proofs are done with the help of well-known exact values for the crossing numbers of the join products of subgraphs of the considered graph with paths and cycles. Finally, by adding some edges to the graph under consideration, we obtain the crossing numbers of the join products of other graphs with the paths and the cycles on n vertices.

Keywords: graph; join product; crossing number; cyclic permutation; path; cycle (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/11/1277/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/11/1277/ (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:9:y:2021:i:11:p:1277-:d:567459

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 ().