z-logo
Premium
Infinite digraphs with nonreconstructible outvalency sequences
Author(s) -
NashWilliams C. S. T. J. A.
Publication year - 1994
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190180510
Subject(s) - mathematics , combinatorics , discrete mathematics
We show that the outvalency sequence of an infinite digraph is not, in general, reconstructible.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here