Split digraphs
Discrete Mathematics
2014-04-25 v3 Combinatorics
Abstract
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.
Keywords
Cite
@article{arxiv.1005.2452,
title = {Split digraphs},
author = {M. Drew LaMar},
journal= {arXiv preprint arXiv:1005.2452},
year = {2014}
}
Comments
14 pages, 2 figures; Accepted author manuscript (AAM) version