THE (n-1)/2-REGULAR GRAPH ON n VERTICES

Main Article Content

An. D Nhu

Abstract

Let  be an undirected and simple graph on  vertices and degree of each vertex is equal . We present some properties of  and confirm that is a Hamiltonian graph.

 

Downloads

Download data is not yet available.

Article Details

Section
Articles

References

An D. Nhu, “Recognizing the Hamiltonian graph with is an easy problemâ€, International Journal of Advanced Reseach in Computer Science, 10 (2), March- April 2019, 42-45.

An D. Nhu, Duong B. Duc, “Some problems about Hamiltonian Cycle in special graphsâ€, The 2nd International Conference on Theories and Applications of Computer Science (ICTACS’09), Journal of Sciencce and Technology, Vietnam Academy of Science and Technology, Vol. 46, No 5A (2008), 57-66.

Bondy J. A. and Chvátal V., A Method in Graph Theory, Discrete Math. 15, p. 111-135, 1976.

Graham R., Lovász L. and Grotschel M., Handbook of combinatorics, Vol 1, Elsevier Science B.V., 1995.

Paul Erdos, “A class of Hamiltonian regular graphsâ€, Journal of Graph Theory, Vol 2 (1978) 129-135.