**
MATHEMATICA BOHEMICA, Vol. 130, No. 1, pp. 101-105 (2005)
**

#
All graphs in which each pair of distinct vertices has exactly two common neighbors

##
Dragan Stevanovic

* Dragan Stevanovic*, Faculty of Science and Mathematics, Visegradska 33, 18000 Nis, Serbia and Montenegro, e-mail: ` dragance@pmf.ni.ac.yu`

**Abstract:** We find all connected graphs in which any two distinct vertices have exactly two common neighbors, thus solving a problem by B. Zelinka.

**Keywords:** graphs, adjacency matrix, eigenvalues of a graph, common neighbours

**Classification (MSC2000):** 05C75, 05C50

**Full text of the article:**

[Previous Article] [Next Article] [Contents of this Number] [Journals Homepage]

*
© 2005–2010
FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition
*