Geodesic
Uniqueness of graph square roots of girth six
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We prove that if two graphs of girth at least $6$ have isomorphic squares, then the graphs themselves are isomorphic. This is the best possible extension of the results of Ross and Harary on trees and the results of Farzad et al. on graphs of girth at least $7$. We also make a remark on reconstruction of graphs from their higher powers.
DOI : 10.37236/626
Classification : 05C12, 05C75
Mots-clés : reconstruction of graphs from their higher powers 
@article{10_37236_626,
     author = {Anna Adamaszek and Micha{\l} Adamaszek},
     title = {Uniqueness of graph square roots of girth six},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/626},
     zbl = {1222.05038},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/626/}
}
TY  - JOUR
AU  - Anna Adamaszek
AU  - Michał Adamaszek
TI  - Uniqueness of graph square roots of girth six
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/626/
DO  - 10.37236/626
ID  - 10_37236_626
ER  - 
%0 Journal Article
%A Anna Adamaszek
%A Michał Adamaszek
%T Uniqueness of graph square roots of girth six
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/626/
%R 10.37236/626
%F 10_37236_626
Anna Adamaszek; Michał Adamaszek. Uniqueness of graph square roots of girth six. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/626

Cité par Sources :