๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Reconstructing the degree pair sequence of a digraph

โœ Scribed by Bennet Manvel

Book ID
107884009
Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
738 KB
Volume
15
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Subgraphs and Their Degree Sequences of
Subgraphs and Their Degree Sequences of a Digraph
โœ Wai-Kai Chen ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 912 KB

7'he paper presents general conditions that are necessary and suficient for the existence of a (p, s) subgraph with prescribed degrees of a given digraph. It is shown that the subgraph problem of a digraph, the degree sequence problem of a digraph, the subgraph problem of a graph and the degree sequ

Reconstructing the degree sequence and t
Reconstructing the degree sequence and the number of components of an infinite graph
โœ Thomas Andreae ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 812 KB

We prove that the degree sequence of an infinite graph is reconstructibjle from its family of vertex-deleted subgraphs. Furthermore, as another result concerning the reconstruction of infinite graphs, we prove that the number c(G) of components of an infinite graph G is re~ons~uct~b~e if there is at