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
_version_ 1782393921946517504
author Cloteaux, Brian
LaMar, M. Drew
Moseman, Elizabeth
Shook, James
author_facet Cloteaux, Brian
LaMar, M. Drew
Moseman, Elizabeth
Shook, James
author_sort Cloteaux, Brian
collection PubMed
description 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.
format Online
Article
Text
id pubmed-4597423
institution National Center for Biotechnology Information
language English
publishDate 2014
publisher [Gaithersburg, MD] : U.S. Dept. of Commerce, National Institute of Standards and Technology
record_format MEDLINE/PubMed
spelling pubmed-45974232015-11-23 Threshold Digraphs Cloteaux, Brian LaMar, M. Drew Moseman, Elizabeth Shook, James J Res Natl Inst Stand Technol Article 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. [Gaithersburg, MD] : U.S. Dept. of Commerce, National Institute of Standards and Technology 2014-05-20 /pmc/articles/PMC4597423/ /pubmed/26601029 http://dx.doi.org/10.6028/jres.119.007 Text en https://creativecommons.org/publicdomain/zero/1.0/ The Journal of Research of the National Institute of Standards and Technology is a publication of the U.S. Government. The papers are in the public domain and are not subject to copyright in the United States. Articles from J Res may contain photographs or illustrations copyrighted by other commercial organizations or individuals that may not be used without obtaining prior approval from the holder of the copyright.
spellingShingle Article
Cloteaux, Brian
LaMar, M. Drew
Moseman, Elizabeth
Shook, James
Threshold Digraphs
title Threshold Digraphs
title_full Threshold Digraphs
title_fullStr Threshold Digraphs
title_full_unstemmed Threshold Digraphs
title_short Threshold Digraphs
title_sort threshold digraphs
topic Article
url 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
work_keys_str_mv AT cloteauxbrian thresholddigraphs
AT lamarmdrew thresholddigraphs
AT mosemanelizabeth thresholddigraphs
AT shookjames thresholddigraphs

Ejemplares similares