Monotone Chromatic Number of Graphs
For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1, 2, ..., k} (using the non-negative integers {1, 2, ..., k} as colors). In this research work, we introduce a new type of graph coloring called monotone coloring, along with this new coloring, we defi...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Etamaths Publishing
2020-09-01
|
| Series: | International Journal of Analysis and Applications |
| Online Access: | http://etamaths.com/index.php/ijaa/article/view/2252 |