On Signed Coloring of Signed Graphs

Main Article Content

Megha S, et. al.


The chromatic number of a signed graph is the number of minimum colors required to color a signed graph such that no two adjacent vertices connected by positive edge receives the same color and two vertices connected by negative edge receives opposite color .In this paper we are finding the positive chromatic number for several graph classes. We define a mapping β+:V(G^*)→{+1,+2,....,+k},where G^* is the signed graph of the underlying graph G. The positive chromatic number is the least positive integer k such that k ∈ {+1,+2,...,+k} which holds the conditions for coloring. We use χ_+ to denote positive chromatic number and χ_0 for zero-free chromatic number


Download data is not yet available.


Metrics Loading ...

Article Details

How to Cite
et. al., M. S. . (2021). On Signed Coloring of Signed Graphs. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 12(13), 1987–1991. https://doi.org/10.17762/turcomat.v12i13.8873