
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.
14 pages, 2 figures; Accepted author manuscript (AAM) version
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Directed graph, Theoretical Computer Science, Degree sequence, FOS: Mathematics, 05C20, 05C69, 05C75, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Split graph, Combinatorics (math.CO), Computer Science - Discrete Mathematics
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Directed graph, Theoretical Computer Science, Degree sequence, FOS: Mathematics, 05C20, 05C69, 05C75, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Split graph, Combinatorics (math.CO), Computer Science - Discrete Mathematics
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
