Split digraphs

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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. © 2012 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Drew LaMar, M. (2012). Split digraphs. Discrete Mathematics, 312(7), 1314–1325. https://doi.org/10.1016/j.disc.2011.12.023

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free