Title of article
Reconstruction of a graph from 2-vicinities of its vertices Original Research Article
Author/Authors
Vladimir Levenshtein، نويسنده , , Elena Konstantinova، نويسنده , , Eugene Konstantinov، نويسنده , , Sergey Molodtsov، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
8
From page
1399
To page
1406
Abstract
We prove that a connected graph of diameter at least 4 and of girth 7 or more (in particular, a tree) can be exactly reconstructed from metric balls of radius 2 of all its vertices. On the other hand, there exist graphs of diameter 3 and of girth 6 which are not reconstructible. This new graph theory problem is motivated by reconstruction of chemical compounds.
Keywords
Graph reconstruction , 2-Vicinity , Graph of neighbourhood , Neighbourhood , Girth , Reconstruction algorithm
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886745
Link To Document