8 citations · 12 across the 7 of their papers we have counts for
7 papers · 1 filter
Kings and serfs in oriented graphs
S. Pirzada, N. A. Shah
In this paper, we extend the concept of kings and serfs in tournaments to that of weak kings and weak serfs in oriented graphs. We obtain various results on the existence of weak k…
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…
New proof of a Theorem on k-hypertournament losing scores
S. Pirzada, Zhou Guofei
In this paper, we give a new and short proof of a Theorem on k-hypertournament losing scores due to Zhou et al.[7].
Mark sequences in digraphs
S. Pirzada, U. Samee
A k-digraph is an orientation of a multi-graph that is without loops and contains at most k edges between any pair of distinct vertices. We obtain necessary and sufficient conditio…