Determining crossing number of join of the discrete graph with two symmetric graphs of order five

DOI10.3390/sym11020123zbMath1416.05194OpenAlexW2910170060WikidataQ128538605 ScholiaQ128538605MaRDI QIDQ2003745

Michal Staš

Publication date: 10 July 2019

Published in: Symmetry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/sym11020123

zbMATH Keywords

crossing numbergood drawingcyclic permutationjoin product

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)

Related Items

The crossing numbers of join products of paths with three graphs of order five ⋮ On the crossing numbers of join products of five graphs of order six with the discrete graph ⋮ ON THE CROSSING NUMBER OF THE JOIN OF THE WHEEL ON FIVE VERTICES WITH THE DISCRETE GRAPH ⋮ On the crossing number of join product of the discrete graph with special graphs of order five ⋮ A survey of graphs with known or bounded crossing numbers ⋮ On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n} ⋮ Determining crossing numbers of the join products of two specific graphs of order six with the discrete graph

Cites Work

• Unnamed Item
• The optimal drawings of \(K_{5,n}\)
• On the crossing numbers of Cartesian products of wheels and trees
• The crossing numbers of join of the special graph on six vertices with path and cycle
• The crossing numbers of join products of paths with graphs of order four
• The Join of Graphs and Crossing Numbers
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS
• The crossing number of K5,n