Mark sequences in digraphs
| dc.creator | Pirzada, S. | |
| dc.creator | Samee, U. | |
| dc.date | 2006-09-05 | |
| dc.date.accessioned | 2026-07-07T07:24:31Z | |
| dc.date.available | 2026-07-07T07:24:31Z | |
| dc.description | 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. | |
| dc.description | 13 pages | |
| dc.identifier | https://arxiv.org/abs/math/0609128 | |
| dc.identifier | http://arxiv.org/abs/math/0609128 | |
| dc.identifier | Seminare Lotharingien de Combinatoire, 55(2006) Art.B55c | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/116382 | |
| dc.subject | Combinatorics | |
| dc.title | Mark sequences in digraphs | |
| dc.type | text |