On Signed Coloring of Signed Graphs
Main Article Content
Abstract
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
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
