Split digraphs

Details Split digraphs Split digraphs

2010-05-14

arxiv.org/abs/1005.2452v2

Computer Science

Discrete Mathematics

14 pages, 2 figures

Scientific paper

We generalize the class of split graphs to the directed case and show that these split digraphs can be identified from their degree sequences. The first degree sequence characterization is an extension of the concept of splittance to directed graphs, while the second characterization says a digraph is split if and only if its degree sequence satisfies one of the Fulkerson inequalities (which determine when an integer-pair sequence is digraphic) with equality.

Affiliated with

Also associated with

No associations

Rating

Split 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 Split digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Split digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-518864