2 citations · 4 across the 4 of their papers we have counts for
4 papers
Signed degree sets in signed bipartite graphs
S. Pirzada, T. A. Naikoo, F. A. Dar
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 posi…
Score sets in oriented bipartite graphs
S. Pirzada, T. A. Naikoo, T. A. Chishti
The set A of distinct scores of the vertices of an oriented bipartite graph D(U, V) is called its score set. We consider the following question: given a finite, nonempty set A of p…
Score lists in [h-k]-bipartite hypertournaments
S. Pirzada, T. A. Chishti, T. A. Naikoo
Given non-negative integers m, n, h and k with and an [h-k]-bipartite hypertournament on vertices is a triple , where U and V are two s…
Signed degree sets in signed graphs
S. Pirzada, T. A. Naikoo, F. A. Dar
The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) in…