THE CHROMATIC NUMBER OF CARTESIAN PRODUCTS

Authors

  • A. Sri Krishna Chaitanya Assistant Professor of Mathematics, Malineni Lakshmaiah Womens engineering College, Pulladigunta, Vatticherukuru (M), Guntur (Dt.) (A.P) INDIA. Author
  • Dr. J. Venkateswara Rao Professor & Principal, Siddhartha Institute of P.G.Studies, Kantepudi (V), Sattenapalli (M), Guntur (Dt.) (A.P.) INDIA Author

DOI:

https://doi.org/10.70153/

Keywords:

Chromatic number, Cartesian product of Graphs, Permutation Graph

Abstract

This paper studies the Chromatic Number of Cartesian Products and Permutation Graphs.       
The main results of this paper are for every two graphs G and H, Chromatic Number of  Cartesian Product G and H is the maximum of chromatic number Of G and Chromatic number  of H and for every graph G and every Permutation Graph of G, the Chromatic number of Graph  G is not more Than the Chromatic number of Permutation Graph and 4/3 of Chromatic Number of Graph G.

Downloads

Published

2009-07-31

Issue

Vol. 1 No. 2 (2009): IJCMI_VOL1_NO2_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

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