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
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.