Geodesic
All graphs in which each pair of distinct vertices has exactly two common neighbors
Mathematica Bohemica, Tome 130 (2005) no. 1, pp. 101-105.

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

We find all connected graphs in which any two distinct vertices have exactly two common neighbors, thus solving a problem by B. Zelinka.
DOI : 10.21136/MB.2005.134219
Classification : 05C50, 05C75
Keywords: graphs; adjacency matrix; eigenvalues of a graph; common neighbours 
@article{10_21136_MB_2005_134219,
     author = {Stevanovi\'c, Dragan},
     title = {All graphs in which each pair of distinct vertices has exactly two common neighbors},
     journal = {Mathematica Bohemica},
     pages = {101--105},
     publisher = {mathdoc},
     volume = {130},
     number = {1},
     year = {2005},
     doi = {10.21136/MB.2005.134219},
     mrnumber = {2128363},
     zbl = {1110.05064},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.2005.134219/}
}
TY  - JOUR
AU  - Stevanović, Dragan
TI  - All graphs in which each pair of distinct vertices has exactly two common neighbors
JO  - Mathematica Bohemica
PY  - 2005
SP  - 101
EP  - 105
VL  - 130
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.2005.134219/
DO  - 10.21136/MB.2005.134219
LA  - en
ID  - 10_21136_MB_2005_134219
ER  - 
%0 Journal Article
%A Stevanović, Dragan
%T All graphs in which each pair of distinct vertices has exactly two common neighbors
%J Mathematica Bohemica
%D 2005
%P 101-105
%V 130
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.2005.134219/
%R 10.21136/MB.2005.134219
%G en
%F 10_21136_MB_2005_134219
Stevanović, Dragan. All graphs in which each pair of distinct vertices has exactly two common neighbors. Mathematica Bohemica, Tome 130 (2005) no. 1, pp. 101-105. doi : 10.21136/MB.2005.134219. http://geodesic.mathdoc.fr/articles/10.21136/MB.2005.134219/

Cité par Sources :