𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Infinite digraphs with nonreconstructible outvalency sequences

✍ Scribed by C. S. T. J. A. Nash-Williams

Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
150 KB
Volume
18
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We show that the outvalency sequence of an infinite digraph is not, in general, reconstructible.

πŸ“œ SIMILAR VOLUMES

Rational functions associated with doubl
Rational functions associated with double infinite sequences of complex numbers
✍ M. Camacho; P. GonzΓ‘lez-Vera πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 690 KB

Let {pk}+\_~ be a given double infinite sequence of complex numbers. By defining a linear functional on the space of the Laurent polynomials, certain rational functions are first constructed and some algebraic properties studied. The hermitian case, i.e. P-k = ilk, k E Z is separately considered an

Asymptotic enumeration of tournaments wi
Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph
✍ Zhicheng Gao; Brendan D. McKay; Xiaoji Wang πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 122 KB

This paper studies the probability that a random tournament with specified score sequence contains a specified subgraph. The exact asymptotic value is found in the case that the scores are not too far from regular and the subgraph is not too large. An ndimensional saddle-point method is used. As a s