In this paper we study the crossing number of the circulant graph C(mk;{1,k}) for m≥3, k≥3, give an upper bound of cr(C(mk;{1,k})), and prove that cr(C(3k;{1,k}) ...

In this paper we study the crossing number of the circulant graph C(m k;{1,k}) for m≥3, k≥3, give an upper bound of c r(C(m k;{1,k})), and prove that c r(C(3k;{ ...

In this paper, we study the crossing number of the circulant graph C ( 3 k + 1 ; { 1 , k } ) and prove that cr ( C ( 3 k + 1 ; { 1 , k } ) ) = k + 1 for k ⩾ 3 .

In this paper we study the crossing number of the circulant graph C(mk ... (C(3k;{1,k}))=k. ... The Crossing Number of C(mk;{1, k}) // Graphs and Combinatorics.

Let G be a simple graph with the vertex set V = V (G) and the edge set E = E(G). The circulant graph C(n; S) is the graph with the vertex set V (C(n; ...

In this paper, we study the crossing number of the circulant graph C(3k+1;{1,k}) and prove that cr(C(3k+1;{1,k}))=k+1 for k⩾3.

In this paper, we study the crossing number of the circulant graph C(3k+1;{1,k}) and prove that cr(C(3k+1;{1,k}))=k+1 for k>=3.

top In this paper we prove that the projective plane crossing number of the circulant graph C(3k;{1,k}) is k-1 for k ≥ 4, and is 1 for k = 3.

This paper studies the crossing number of the circulant graph C(mk;{1,k}) for m≥3, k≤3, gives an upper bound of cr, and proves that cr(C(3k;{2,k}))=k, ...

The crossing number is an important measure of the non-planarity of a graph. Bhatt and Leighton [1] showed that the crossing number of a network (graph).