HAMILTONIAN COLORINGS

Authors

  • A. Sri Krishna Chaitanya Assistant Professor of Mathematics, Malineni Lakshmaiah, and Women’s engineering College, Pulladigunta, Vatticherukuru (M), Guntur (Dt.) (A.P) INDIA Author
  • Dr. J. Venkateswara Rao Professor of Mathematics, Mekelle University Main Campus, P.O.BOX NO:231, Mekelle, Ethiopia Author

DOI:

https://doi.org/10.70153/ijcmi/2009.1309

Keywords:

Chromatic number, Hamiltonian coloring, Hamiltonian chromatic number, pendant edge, spanning connected graph

Abstract

This paper studies the Hamiltonian coloring and Hamiltonian chromatic number for different graphs .the main results are1.For any integer n greater than or equal to three, Hamiltonian chromatic number of Cn is equal to n-2.  2. G is a graph obtained by adding a pendant edge to Hamiltonian graph H, and then Hamiltonian chromatic number of G is equal to n-1. 3. For every connected graph G of order n greater than or equal to 2, Hamiltonian chromatic number of G is not more than one increment of square of (n-2).  
Mathematics Subject Classification 2000: 03Exx, 03E10, 05CXX, 05C15, 05C45.

Downloads

Published

2009-12-31

Issue

Vol. 1 No. 3 (2009): IJCMI_VOL1_NO3_2009

Section

Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Most read articles by the same author(s)

Similar Articles

11-13 of 13

You may also start an advanced similarity search for this article.