Title:
|
All graphs in which each pair of distinct vertices has exactly two common neighbors (English) |
Author:
|
Stevanović, Dragan |
Language:
|
English |
Journal:
|
Mathematica Bohemica |
ISSN:
|
0862-7959 (print) |
ISSN:
|
2464-7136 (online) |
Volume:
|
130 |
Issue:
|
1 |
Year:
|
2005 |
Pages:
|
101-105 |
Summary lang:
|
English |
. |
Category:
|
math |
. |
Summary:
|
We find all connected graphs in which any two distinct vertices have exactly two common neighbors, thus solving a problem by B. Zelinka. (English) |
Keyword:
|
graphs |
Keyword:
|
adjacency matrix |
Keyword:
|
eigenvalues of a graph |
Keyword:
|
common neighbours |
MSC:
|
05C50 |
MSC:
|
05C75 |
idZBL:
|
Zbl 1110.05064 |
idMR:
|
MR2128363 |
DOI:
|
10.21136/MB.2005.134219 |
. |
Date available:
|
2009-09-24T22:18:42Z |
Last updated:
|
2020-07-29 |
Stable URL:
|
http://hdl.handle.net/10338.dmlcz/134219 |
. |
Reference:
|
[1] D. Cvetković, M. Doob, H. Sachs: Spectra of Graphs. Theory and Applications.Johann A. Barth, Heidelberg, 1995. MR 1324340 |
Reference:
|
[2] R. Diestel: Graph Theory.Second edition, Graduate Texts in Mathematics, vol. 173, Springer, New York, 2000. Zbl 0957.05001, MR 1743598 |
Reference:
|
[3] B. Zelinka: Graphs in which each pair of vertices has exactly two common neighbours.Math. Bohem. 118 (1993), 163–165. Zbl 0777.05092, MR 1223481 |
. |