About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Zelinka, Bohdan
Graphs in which each pair of vertices has exactly two common neighbours. (English). Mathematica Bohemica, vol. 118 (1993), issue 2, pp. 163-165
MSC: 05C40, 05C75 | MR 1223481 | Zbl 0777.05092 | DOI: 10.21136/MB.1993.126053
Keywords:
connected graphs; adjacency in a graph; regular graph; wheel
Summary:
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.
References:
[1] Graphs '91, The Czechoslovak conference on graph theoгy held at Zemplínska Šírava in June 1991. Zbl 1170.11300
[2] Ore O.: Theory of Gгaphs. AMS Colloq. Publ. Providence, Rhode Island, 1962.
Partner of
EuDML logo