You are here: Home :: Area NEM :: Mathematics

S. Pirzada

Mark sequences in multigraphs

An r-digraph is an orientation of a multigraph which has no loops and contains at most r edges between any pair of distinct vertices. We give a simple proof of necessary and sufficient conditions for a sequence of non-negative integers arranged in nondecreasing order to be a sequence of numbers, called marks or r-scores, attached to the vertices of an r-digraph.

Discrete Mathematics and Applications, Walter de Gruyter

Print ISSN: 0924-9266
Volume: 17, 04/2007
Pages: 71 - 76

Show full article (external site)

Show all available items of this journal

 

Area NEM