Title of article
The crossing numbers of join product of four graphs on six vertices with discrete graphs
Author/Authors
Stas ، Michal Department of Mathematics and Theoretical Informatics - Faculty of Electrical Engineering and Informatics - Technical University
From page
241
To page
252
Abstract
The main aim of the paper is to give the crossing number of the join product G* + D_n for the graph G* isomorphic to 4-regular graph on six vertices except for two distinct edges with no common vertex such that two remaining vertices are still adjacent, and where D_n consists of n isolated vertices. The proofs are done with possibility of an existence of a separating cycle in some particular drawing of the investigated graph G* and also with the help of well-known exact values for crossing numbers of join products of two subgraphs H_k of G* with discrete graphs.
Keywords
graph , good drawing , crossing number , join product , separating cycle
Journal title
Communications in Combinatorics and Optimization
Journal title
Communications in Combinatorics and Optimization
Record number
2762214
Link To Document