Moderate-to-severe psoriasis is known to affect millions of people around the globe. This chronic disease substantially impacts patients by impairing their quality of life, causing psychosocialâ€¦ (More)

We characterize irreducible score sequences of oriented graphs and give a condition for a score sequence to belong to exactly one oriented graph. AMS Mathematics Subject Classification (2000): 05C

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â€¦ (More)

An oriented graph is a digraph with no symmetric pairs of directed arcs and without loops. The score of a vertex vi in an oriented graph D is avi ( or simply ai) = n âˆ’ 1 + d + vi âˆ’ d âˆ’ vi , where d +â€¦ (More)

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) integers is theâ€¦ (More)

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 conditions for a sequenceâ€¦ (More)