A signed graph has all its edges signed with either negative or positive signs. Parity signed graphs are generated from the integer labeling of the vertices of a graph. An edge gets a positive sign if its end vertices are of the same parity and gets a negative sign if its end vertices are of the opposite parity. Signed graphs which admit parity labeling can be characterized. All parity signed graphs are balanced but not the converse.
Discussion(0)
No comments yet. Be the first to comment.