Tight Bound on the Diameter of the Knödel Graph. - Hayk Grigoryan 001; Hovhannes A. Harutyunyan (IWOCA, 2013)

New Lower Bounds on Broadcast Function. - Hayk Grigoryan 001; Hovhannes A. Harutyunyan (AAIM, 2014)

Tight lower bounds on broadcast function for n=24 and 25. - Georgy Barsky; Hayk Grigoryan 001; Hovhannes A. Harutyunyan (Discret. Appl. Math., 2014)

Diametral broadcast graphs. - Hayk Grigoryan 001; Hovhannes A. Harutyunyan (Discret. Appl. Math., 2014)

The shortest path problem in the Knödel graph. - Hayk Grigoryan 001; Hovhannes A. Harutyunyan (J. Discrete Algorithms, 2015)