On the Crossing Numbers of the Joining of a Specific Graph on Six Vertices with the Discrete Graph
In the paper, we extend known results concerning crossing numbers of join products of small graphs of order six with discrete graphs. The crossing number of the join product G ∗ + D n for the graph G ∗ on six vertices consists of one vertex which is adjacent with three non-consecutive vertices of the 5-cycle. The proofs were based on the idea of establishing minimum values of crossings between two different subgraphs that cross the edges of the graph G ∗ exactly once. These minimum symmetrical values are described in the individual symmetric tables.
Keyword(s):
2008 ◽
Vol 17
(09)
◽
pp. 1043-1050
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
2020 ◽
Vol 29
(04)
◽
pp. 2050019
Keyword(s):
1997 ◽
Vol 6
(3)
◽
pp. 353-358
◽
Keyword(s):
2004 ◽
Vol 13
(07)
◽
pp. 857-866
◽
Keyword(s):