Mark sequences in digraphs

From MaRDI portal
Publication:2654595




Abstract: 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 of non-negative integers in non-decreasing order to be a sequence of numbers, called marks (k-scores), attached to vertices of a k-digraph. We characterize irreducible mark sequences in k-digraphs and uniquely realizable mark sequences in 2-digraphs.









This page was built for publication: Mark sequences in digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2654595)