G-2004-55
All Graphs in Which Each Pair of Distinct Vertices Has Exactly Two Common Neighbors
BibTeX reference
We find all connected graphs in which any two distinct vertices have exactly two common neighbors, thus solving a problem by B. Zelinka.
Published July 2004 , 7 pages
Publication
Jan 2005
All Graphs in Which Each Pair of Distinct Vertices Has Exactly Two Common Neighbors
Mathematica Bohemica, 130, 101–105, 2005
BibTeX reference
Document
G-2004-55.pdf (100 KB)