Signed degree sets in signed 3-partite graphs
Keywords:
Signed graph, signed tripartite graph, signed degree, signed setSubjects:
05C22Abstract
If each edge of a 3-partite graph is assigned a positive or anegative sign then it is called a signed 3-partite graph. Also,signed degree of a vertex x in a signed 3-partite graph is thenumber of positive edges incident with x less than the number ofnegative edges incident with x. The set of distinct signed degreesof the vertices of a signed 3-partite graph is called its signeddegree set. In this paper, we prove that every set of n integersis the signed degree set of some connected signed 3-partite graph.
Downloads
Published
2007-07-15
Issue
Section
Articles
License
Copyright (c) 2007 Authors retain copyright to their work.
This work is licensed under a Creative Commons Attribution 4.0 International License.