BibTex Citation Data :
@article{JM607, author = {Erly L. and Susilo Hariyanto}, title = {SIFAT-SIFAT GRAF (2n)}, journal = {MATEMATIKA}, volume = {11}, number = {3}, year = {2010}, keywords = {}, 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 n ) as set of their vertices is denoted (2 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. }, url = {https://ejournal.undip.ac.id/index.php/matematika/article/view/607} }
Refworks Citation Data :
A sequence of non negative integers d = (d1, d2, …, dn) 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(2n), whereas a graph with R(2n) as set of their vertices is denoted (2n) . Two vertices in graph (2n) 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, (2n) is a connected and bipartite graph.
Last update:
Last update: 2024-04-17 01:04:29