#### Filter Results:

#### Publication Year

2010

2016

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

- Koko K. Kayibi, Muhammad Ali Khan, +5 authors A. Iványi
- 2012

The imbalance of a vertex v in a digraph D is defined as a(v) = d + (v)−d − (v), where d + (v) and d − (v) respectively denote the out-degree and indegree of vertex v. The imbalance sequence of D is formed by listing vertex imbalances in nondecreasing order. We define a minimally cyclic digraph as a connected digraph which is either acyclic or has exactly… (More)

- K. K. Kayibi, Muhammad Ali Khan, S. Pirzadac
- 2010

The incidence matrix of a k-hypertournament is called a k-hypertournament matrix. The score (losing score) sequence of a k-hypertournament matrix is the score (losing score) sequence of its corresponding hypertournament. In this paper, we investigate the problem of randomly sampling all k-hypertournaments with a given score (equivalently losing score)… (More)

- Koko K. Kayibi, S. Pirzada
- Discrete Mathematics
- 2016

- Koko K. Kayibi, S. Pirzada
- Graphs and Combinatorics
- 2012

Ecological occurrence matrices, such as Darwin finches tables, are 0, 1-matrices whose rows are species of animals and colums are islands, and the (i, j) entry is 1 if animal i lives in island j, and is 0 otherwise. Moreover the row sums and columns sums are fixed by field observation of these islands. These occurence matrices are thus just bipartite graphs… (More)

A k-hypertournament is a complete k-hypergraph with each k-edge endowed with an orientation, that is, a linear arrangement of the vertices contained in the edge. In a k-hypertournament, the score s i (losing score r i) of a vertex v i is the number of arcs containing v i in which v i is not the last element (in which v i is the last element). The total… (More)

- ‹
- 1
- ›