G-2004-55
All Graphs in Which Each Pair of Distinct Vertices Has Exactly Two Common Neighbors
référence BibTeX
We find all connected graphs in which any two distinct vertices have exactly two common neighbors, thus solving a problem by B. Zelinka.
Paru en juillet 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
référence BibTeX
Document
G-2004-55.pdf (95 Ko)