• ON VALUE OF CONDITIONAL CHROMATIC NUMBEROF THE HAMILTONIAN GRAPHS
Abstract
Let a graph will refer to vertex set , with , and edge set with in addition to nodes and lines. A cycle (or -cycle) is a simple cycle. In this paper we investigate the value of when the number of edges in is large [1] and present a series of theorems in which the value of is given when is missing a small number of edges.
Keywords
Nodes, Complete graphs, Color classes, -cycle, -coloring, Hamiltonian sub graphs, Hamiltonian cycles
Full Text:
pdf
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
| © 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |