### SIFAT-SIFAT GRAF (2n)

#### Abstract

A sequence of non negative integers *d = (d _{1}, d_{2}, …, d_{n})* is said a sequence of graphic if it is the degree sequence of a simple graph

*G*. In this case, graph

*G*is called realization for

*d.*The set of all realizations of non isomorfic 2-regular

*graph with order*

*n*(

*n*

*≥*3)

*is*

*denoted*

*R*(2

^{n}), whereas a graph with

*R(2*as set of their vertices is denoted (2

^{n})^{n}) . Two vertices in graph (2

^{n}) are called adjacent if one of these vertices can be derived from the other by

*switching*. In the present paper, we prove that for n

*≥*6, (2

^{n}) is a connected and bipartite graph.

** **

#### Full Text:

PDF### Refbacks

- There are currently no refbacks.

**Jurnal Matematika, Fakultas Sains dan Matematika, Universitas Diponegoro.**Jl. Prof. Sudarto Tembalang. telp/fax (024)76480922 Semarang 50275