To search, Click below search items.

 

All Published Papers Search Service

Title

Some Properties of Graph R(2N)

Author

Chawalit Iamjaroen

Citation

Vol. 7  No. 5  pp. 90-94

Abstract

Let N be a positive integer, N ≥ 3, and R(2n) be the set of all non isomorphic 2-regular graphs of order N. The graph of realizations, R(2n) , can be defined as a graph whose vertex set is R(2n) two vertices are adjacent if one can be obtained from the other by a switching. It is known that the graph R(2n) is connected. We prove in this paper that the graph R(2n) is bipartite and it has no Eulerian trail for N ≥ 12.

Keywords

Realization, Bipartite, 2-regular graph, Eulerian trail

URL

http://paper.ijcsns.org/07_book/200705/20070514.pdf