This article is cited in 1 paper

Reconstruction conjecture for graphs with restrictions for 4-vertex paths

P. V. Skums, R. I. Tyshkevich

Belarusian State University, Minsk, Belarus

Abstract: The well-known Kelly–Ulam reconstruction conjecture is considered. It is proved that the conjecture holds for $P_4$-disconnected and $P_4$-tidy graphs. In particular, it generalizes the known results on the reconstructibility of disconnected graphs, complements of disconnected graphs, 1-decomposable graphs, and $P_4$-reducible graphs. Bibl. 19.

Keywords: reconstruction conjecture, $P_4$-disconnected graphs, $P_4$-tidy graphs, $P_4$-reducible graphs, 1-decomposable graphs.

UDC: 519.1

Received: 29.01.2009
Revised: 22.05.2009

Bibliographic databases:

• 
•