scholarly journals Crossing Numbers of Periodic Graphs

2015 ◽  
Vol 83 (1) ◽  
pp. 34-43 ◽  
Author(s):  
Zdeněk Dvořák ◽  
Bojan Mohar
Keyword(s):  
Crossing Numbers ◽  
Periodic Graphs

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

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1277
Author(s):  
Michal Staš
Keyword(s):  
Connected Graph ◽  
Crossing Numbers ◽  
Tripartite Graph ◽  
Complete Tripartite Graph

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 K1,1,3\e obtained by removing one edge e incident with some vertex of order two from the complete tripartite graph K1,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.

Estimation of number of modes in periodic graphs

2009 ◽  
Vol 19 (3) ◽  
pp. 556-565
Author(s):  
M. S. Dorofeev ◽  
A. V. Shanin
Keyword(s):  
Periodic Graphs

Cyclic permutations and crossing numbers of join products of two symmetric graphs of order six

2019 ◽  
Vol 35 (2) ◽  
pp. 137-146
Author(s):  
STEFAN BEREZNY ◽  
MICHAL STAS ◽  
◽  
Keyword(s):  
Crossing Number ◽  
Crossing Numbers ◽  
Symmetric Graphs ◽  
Isolated Vertex ◽  
Join Of Graphs ◽  
Discrete Graph

The main purpose of this article is broaden known results concerning crossing numbers for join of graphs of order six. We give the crossing number of the join product G + Dn, where the graph G consists of one 5-cycle and of one isolated vertex, and Dn consists on n isolated vertices. The proof is done with the help of software that generates all cyclic permutations for a given number k, and creates a new graph COG for calculating the distances between all vertices of the graph. 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 Dn and with the path Pn on n vertices for other two graphs.

scholarly journals Bipartite crossing numbers of meshes and hypercubes

1997 ◽  
pp. 37-46 ◽  
Author(s):  
Farhad Shahrokhi ◽  
Ondrej Sykora ◽  
László A. Székely ◽  
Imrich Vrt'o
Keyword(s):  
Crossing Numbers
Sign in / Sign up

Export Citation Format

Share Document