Reconstruction Problems for Digraphs

Martin Aigner and Eberhad Triesch ()
Additional contact information
Martin Aigner: Freie Universität, Berlin, Mathematics Institut
Eberhad Triesch: Forschungsinstitut für Diskrete Mathematik

A chapter in The Mathematics of Paul Erdős II, 2013, pp 5-13 from Springer

Abstract: Summary Associate to a finite directed graph G(V, E) its out-degree resp. in-degree sequences d +, d − and the corresponding neighborhood lists N +, N − (when G is a labeled graph). We discuss various problems when sequences resp. lists of sets can be realized as degree sequences resp. neighborhood lists of a directed graph.

Keywords: Neighborhood List; Sequences Resp; Simple Directed Graph; Gale-Ryser Theorem; Simple Digraph (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7254-4_1

Ordering information: This item can be ordered from
http://www.springer.com/9781461472544

DOI: 10.1007/978-1-4614-7254-4_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().