- Tytuł:
- A reduction of the Graph Reconstruction Conjecture
- Autorzy:
-
Monikandan, S.
Balakumar, J. - Powiązania:
- https://bibliotekanauki.pl/articles/30148259.pdf
- Data publikacji:
- 2014-08-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
reconstruction
diameter
geodetic graph
interval-regular graph - Opis:
- A graph is said to be reconstructible if it is determined up to isomorphism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC) asserts that all graphs on at least three vertices are reconstructible. In this paper, we prove that interval-regular graphs and some new classes of graphs are reconstructible and show that RC is true if and only if all non-geodetic and non-interval-regular blocks G with diam(G) = 2 or diam(G) = diam(Ḡ) = 3 are reconstructible.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2014, 34, 3; 529-537
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł