• ON PROPERTIES AND IMPLICATIONS FOR CONDITIONAL CHROMATIC NUMBER OF GRAPHS

P. Srilakshmi*, R. Siva Prasad

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 properties of the conditional chromatic number of graph . The point arboricity for a family of graphs is also an upper bound for -chromatic numbers. We establish the implications for from .


Keywords


Total number of color classes, Complete bipartite graph, Point arboricity

Full Text:

pdf


Creative Commons License
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
Web Counter