Graphs in which each pair of vertices has exactly two common neighbours

Zelinka, Bohdan. "Graphs in which each pair of vertices has exactly two common neighbours." Mathematica Bohemica 118.2 (1993): 163-165. <http://eudml.org/doc/29207>.

@article{Zelinka1993,
abstract = {The paper studies graphs in which each pair of vertices has exactly two common neighbours. It disproves a conjectury by P. Hliněný concerning these graphs.},
author = {Zelinka, Bohdan},
journal = {Mathematica Bohemica},
keywords = {connected graphs; adjacency in a graph; regular graph; wheel; connected graphs},
language = {eng},
number = {2},
pages = {163-165},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Graphs in which each pair of vertices has exactly two common neighbours},
url = {http://eudml.org/doc/29207},
volume = {118},
year = {1993},
}

TY - JOUR
AU - Zelinka, Bohdan
TI - Graphs in which each pair of vertices has exactly two common neighbours
JO - Mathematica Bohemica
PY - 1993
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 118
IS - 2
SP - 163
EP - 165
AB - The paper studies graphs in which each pair of vertices has exactly two common neighbours. It disproves a conjectury by P. Hliněný concerning these graphs.
LA - eng
KW - connected graphs; adjacency in a graph; regular graph; wheel; connected graphs
UR - http://eudml.org/doc/29207
ER -