T. A. Naikoo

most citedSigned degree sets in signed bipartite graphs

2 citations · 4 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2010★ 3 cited

Imbalances in directed multigraphs

S. Pirzada, T. A. Naikoo, U. Samee +1

In a directed multigraph, the imbalance of a vertex $v_{i}$ is defined as $b_{v_{i}} = d_{v_{i}}^{+} - d_{v_{i}}^{-}$ , where $d_{v_{i}}^{+}$ and $d_{v_{i}}^{-}$ denote the outdegree an…

math.CO2006★ 2 cited

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…

math.CO2006★ 1 cited

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…

math.CO2006★ 1 cited

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 $m \geq h > 1$ and $n \geq k > 1,$ an [h-k]-bipartite hypertournament on $m + n$ vertices is a triple $(U, V, A)$ , where U and V are two s…

math.CO2006

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…