Signed degree sets in signed bipartite graphs

Simple item page
dc.creatorPirzada, S.
dc.creatorNaikoo, T. A.
dc.creatorDar, F. A.
dc.date2006-09-05
dc.date2006-09-07
dc.date.accessioned2026-07-07T07:24:30Z
dc.date.available2026-07-07T07:24:30Z
dc.descriptionA signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V) is called its signed degree set. In this paper, we prove that every set of integers is the signed degree set of some connected signed bipartite graph. \medskip \medskip
dc.identifierhttps://arxiv.org/abs/math/0609122
dc.identifierhttp://arxiv.org/abs/math/0609122
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116380
dc.subjectCombinatorics
dc.titleSigned degree sets in signed bipartite graphs
dc.typetext

Files

Collections

arXiv