Mark sequences in digraphs

Details Mark sequences in digraphs Mark sequences in digraphs

2006-09-05

arxiv.org/abs/math/0609128v1

Seminare Lotharingien de Combinatoire, 55(2006) Art.B55c

Mathematics

Combinatorics

13 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Mark sequences in digraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Mark sequences in digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mark sequences in digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-554965