Loading...
Split digraphs
LaMar, M. Drew
LaMar, M. Drew
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. (C) 2012 Elsevier B.V. All rights reserved.
Description
Date
2012-01-01
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Download Dataset
Files
Loading...
Split_digraphs.pdf
Adobe PDF, 264.5 KB
Rights Holder
Usage License
Embargo
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
Advisor
Department
Biology
DOI
10.1016/j.disc.2011.12.023