Threshold Digraphs

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Cloteaux, Brian, LaMar, M. Drew, Moseman, Elizabeth, Shook, James
Formato: Online Artículo Texto
Lenguaje:English
Publicado: [Gaithersburg, MD] : U.S. Dept. of Commerce, National Institute of Standards and Technology 2014
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4597423/
https://www.ncbi.nlm.nih.gov/pubmed/26601029
http://dx.doi.org/10.6028/jres.119.007
Descripción
Sumario: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.

Ejemplares similares