|
Diskretnyi Analiz i Issledovanie Operatsii, 2009, Volume 16, Issue 4, Pages 87–96
(Mi da581)
|
|
|
|
This article is cited in 1 scientific paper (total 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.
Received: 29.01.2009 Revised: 22.05.2009
Citation:
P. V. Skums, R. I. Tyshkevich, “Reconstruction conjecture for graphs with restrictions for 4-vertex paths”, Diskretn. Anal. Issled. Oper., 16:4 (2009), 87–96
Linking options:
https://www.mathnet.ru/eng/da581 https://www.mathnet.ru/eng/da/v16/i4/p87
|
Statistics & downloads: |
Abstract page: | 634 | Full-text PDF : | 186 | References: | 45 | First page: | 19 |
|