Determining crossing number of join of the discrete graph with two symmetric graphs of order five
type: Item
instance of: scholarly article
title: Determining crossing number of join of the discrete graph with two symmetric graphs of order five
zbMATH Open document ID: 1416.05194
author: Michal Staš
published in: Symmetry
publication date: 2019-07-10T00:00:00Z
review text: Summary: The main aim of the paper is to give the crossing number of the join product \(G + D_n\) for the disconnected graph \(G\) of order five consisting of one isolated vertex and of one vertex incident with some vertex of the three-cycle, and \(D_n\) consists of \(n\) isolated vertices. In the proofs, the idea of the new representation of the minimum numbers of crossings between two different subgraphs that do not cross the edges of the graph \(G\) by the graph of configurations \(\mathcal{G}_D\) in the considered drawing \(D\) of \(G + D_n\) will be used. Finally, by adding some edges to the graph \(G\), we are able to obtain the crossing numbers of the join product with the discrete graph \(D_n\) and with the path \(P_n\) on \(n\) vertices for three other graphs.
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C76
zbMATH DE Number: 7078091
zbMATH Keywords: good drawing
zbMATH Keywords: crossing number
zbMATH Keywords: join product
zbMATH Keywords: cyclic permutation
MaRDI profile type: Publication
full work available at URL: sym11020123
OpenAlex ID: W2910170060
cites work: The Join of Graphs and Crossing Numbers
cites work: The crossing number of K5,n
cites work: The crossing numbers of join products of paths with graphs of order four
cites work: The crossing numbers of join of the special graph on six vertices with path and cycle
cites work: On the crossing numbers of Cartesian products of wheels and trees
cites work: DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS
cites work: The optimal drawings of \(K_{5,n}\)
cites work: Q5215276
cites work: Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
Wikidata QID: Q128538605
DOI: 10.3390/SYM11020123
description: scientific article; zbMATH DE number 7078091