The ally-reconstruction number of a tree with five or more vertices is three

The ally‐reconstruction number of a graph G, ally‐rn(G), is the minimum number of vertex‐deleted subgraphs required in order to identify G up to isomorphism. In this paper, we show that ally‐rn(T) = 3 for any tree T with five or more vertices.

Bibliographische Detailangaben

Veröffentlicht in:	Journal of graph theory 1990-06, Vol.14 (2), p.149-166
1. Verfasser:	Myrvold, Wendy
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Combinatorics. Ordered structures Exact sciences and technology Graph theory Mathematics Sciences and techniques of general use
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!