We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
The Crossing Number of the Circulant Graph C(3k - 1; {1, k}).
- Authors
Jing Wang; Yuanqiu Huang
- Abstract
A Smarandache drawing of a graph G is a drawing of G on the plane with minimal intersections for its each component and a circulant graph C(n; S) is the graph with vertex set V (C(n; S)) = {vi∣0 ⩽ i ⩽ n-1} and edge set E(C(n; S)) = {vivj ∣0 ≤ i ≠ j ≤ n-1, (i-j)mod n ε S}, S ⊆ {1, 2, … , [n⁄2]}. In this paper, we investigate the crossing number of the circulant graph C(3k-1; {1, k}) and get the result that k ≤ cr(C(3k-1; {1, k})) ≤ k+1 for k ⩾ 3.
- Subjects
SMARANDACHE function; SMARANDACHE notions; GRAPH theory; COMBINATORICS; GRAPHIC methods; REPRESENTATIONS of graphs
- Publication
International Journal of Mathematical Combinatorics, 2008, Vol 3, p79
- ISSN
1937-1055
- Publication type
Article