Abstract
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.
Cite
CITATION STYLE
APA
Aigner, M., & Triesch, E. (2013). Reconstruction problems for digraphs. In The Mathematics of Paul Erdos II, Second Edition (pp. 5–13). Springer New York. https://doi.org/10.1007/978-1-4614-7254-4_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free