#### Filter Results:

#### Publication Year

2005

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

The circular graph C(n, m) is such a graph that whose vertex set is {v 0 , v 1 , v 2 , · · · , v n−1 } and edge set is {v i v i+1 , v i v i+m | i = 0, 1, · · · , n − 1}, where m, n are natural numbers, addition is modulo n, and 2 ≤ m ≤ n 2. This paper shows the crossing number of the circular graph C(2m + 2, m)(m ≥ 3) is m + 1.

In this paper, we study the minimum cycle base of the planar graphs obtained from two 2-connected planar graphs by identifying an edge (or a cycle) of one graph with the corresponding edge (or cycle) of another, related with map geometries, i.e., Smarandache 2-dimensional manifolds. Also, we give a formula for calculating the length of minimum cycle base of… (More)

- ‹
- 1
- ›