Shariefuddin Pirzada

Suggest Changes
Learn 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)