The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. The crossing numbers of G□C n for some graphs G on five and six vertices and the cycle C n are also given. In this paper, we extend these results by determining the crossing number of the Cartesian product G □ C n, where G is a specific graph on six vertices.
Contents
-
August 24, 2011
-
August 24, 2011
-
August 24, 2011
-
August 24, 2011
-
Open AccessDensities generated by equivalent measuresAugust 24, 2011
-
August 24, 2011
-
Open AccessExistence of nontrivial solutions for boundary value problems of second-order discrete systemsAugust 24, 2011
-
Open AccessStrongly almost (ω, λ, q)-summable sequencesAugust 24, 2011
-
August 24, 2011
-
August 24, 2011
-
Open AccessGeometry of isometric reflection vectorsAugust 24, 2011
-
Open AccessThe stability of an additive functional equation in menger probabilistic φ-normed spacesAugust 24, 2011
-
Open AccessOn isometries in GMV-algebrasAugust 24, 2011