Signed degree sets in signed bipartite graphs

arXivmath/0609122MaRDI QIDQ6477798FDOQ6477798

Authors: Shariefuddin Pirzada, T. A. Naikoo, Farooq A. Dar 

Publication date: 5 September 2006

Abstract: A 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

This page was built for publication: Signed degree sets in signed bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6477798)