|
|
| |
| Chromaticity of Ladder and Book Graphs |
H. H. Mohammed, A. M. Khalaf, M. Othman
|
Abstract:
Graph colorings is one of the important issues statements that appeared while scientists trying to solve the issue of four colors. Frequently, we are concerned with determining the least number of colors with which we can achieve a proper coloring on a graph. Furthermore, we want to count the possible number of different proper colorings on a graph with a given number of colors. We can calculate each of these values by using a special function that is associated with each graph, called the Chromatic Polynomial.
Justifications and reasons for choosing this Search is the frequent applications of the subject in various areas such as chemistry, Nano technology, computer networks, channel assignment, scheduling and numerous different application while still mystery surrounds much of the theoretical aspects of the subject. Research of theoretical and applied research. Either beneficiaries understand graph theory researchers in addition to those interested in computer networks.
In this article, we study the chromaticity of ladder and book graphs, which means study chromatically equivalent and chromatically unique of ladder and book graphs.
2010 Mathematics Classification Subject: 05C15.
|
|
|
| | |