Cycles of Length 4 or 8 in Graphs with Diameter 2 and Minimum Degree at Least 3

In this short note it is shown that every graph of diameter 2 and minimum degree at least 3 contains a cycle of length 4 or 8. This result contributes to the study of the Erdős--Gyárfás Conjecture.