A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degree sequences, and show these characterizations to be equivalent. Using this result, we obtain a new, short proof of the Fulkerson-Chen theorem on degree sequences of general digraphs.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4597423 | PMC |
| http://dx.doi.org/10.6028/jres.119.007 | DOI Listing |
Publication Analysis
Top Keywords
threshold digraphs
8
degree sequences
8
digraphs digraph
4
digraph degree
4
degree sequence
4
sequence unique
4
unique vertex
4
vertex labeled
4
labeled realization
4
realization called
4
Similar Publications
Want AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!