Title of article
Reconstruction of a graph from 2–vicinities of its vertices
Author/Authors
Levenshtein، نويسنده , , Vladimir and Konstantinova، نويسنده , , Elena and Konstantinov، نويسنده , , Eugene and Molodtsov، نويسنده , , Sergey، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
5
From page
347
To page
351
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 , girth , Neighbourhood , 2–vicinity , Reconstruction algorithm , graph of neighbourhood
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454048
Link To Document