Abstract
We introduce joins of signed graphs and explore the chromatic number of the all-positive and all-negative joins. We prove an analogue to the theorem that the chromatic number of the join of two graphs equals the sum of their chromatic numbers. Given two signed graphs, the chromatic number of the all-positive and all-negative join is usually less than the sum of their chromatic numbers, by an amount that depends on the new concept of deficiency of a signed-graph coloration.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.