Dragan Stevanovic, Faculty of Science and Mathematics, Visegradska 33, 18000 Nis, Serbia and Montenegro, e-mail: firstname.lastname@example.org
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 (MSC 2000): 05C75, 05C50
Full text available as PDF (smallest), as compressed PostScript (.ps.gz) or as raw PostScript (.ps).
Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade. To activate your access, please contact Myris Trade at email@example.com.