DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS
2018 ◽
Vol 98
(3)
◽
pp. 353-362
◽
We extend known results concerning crossing numbers by giving the crossing number of the join product$G+D_{n}$, where the connected graph$G$consists of one$4$-cycle and of two leaves incident with the same vertex of the$4$-cycle, and$D_{n}$consists of$n$isolated vertices. The proofs are done with the help of software that generates all cyclic permutations for a given number$k$and creates a graph for calculating the distances between all$(k-1)!$vertices of the graph.
2008 ◽
Vol 17
(09)
◽
pp. 1043-1050
◽
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):
2019 ◽
Vol 28
(14)
◽
pp. 1950085
Keyword(s):