R. Ahlswede, L. Gargano, H. S. Haroutunian, and L. H. Khachatrian, Fault-tolerant minimum broadcast networks, Networks, vol.27, issue.4, pp.293-307, 1996.
DOI : 10.1002/(SICI)1097-0037(199607)27:4<293::AID-NET4>3.0.CO;2-B

R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory

R. Balakrishnan and P. Paulraja, Hamilton cycles in tensor product of graphs, Discrete Math, pp.1-13, 1998.

R. Balakrishnan, P. Paulraja, W. So, and . Vinay, The automorphism group of the Knödel graph W k,2 k (submitted)

J. Bermond, H. A. Harutyunyan, A. L. Liestman, and S. Perennes, A Note on the Dimensionality of Modified Kn??del Graphs, International Journal of Foundations of Computer Science, vol.08, issue.02, pp.109-116, 1997.
DOI : 10.1142/S0129054197000094

P. Fraigniaud and J. G. Peters, Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs, Networks, vol.3, issue.3, pp.150-162, 2001.
DOI : 10.1002/net.1033

G. Fertin and A. Raspaud, A survey on Kn??del graphs, Discrete Applied Mathematics, vol.137, issue.2, pp.173-195, 2004.
DOI : 10.1016/S0166-218X(03)00260-9

G. Fertin, A. Raspaud, H. Schröder, and O. , S´ykoraS´ykora, and I. Vrt'o, Diameter of the Knödel graph, Proc. 26th International Workshop on Graph-Theoretic Concepts in Computer Science, pp.149-160, 1928.

G. Fertin and A. Raspaud, Families of Graphs Having Broadcasting and Gossiping Properties, Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG' 98), pp.63-77, 1998.
DOI : 10.1016/0304-3975(92)00094-8

G. Gauyacq, Routages uniformes dans les graphes sommet-transitifs, 1995.

H. Grigoryan and H. A. Harutyunyan, Tight Bound on the Diameter of the Knödel Graph, IWOCA, vol.2013, pp.206-215

H. Grigoryan and H. A. Harutyunyan, The shortest path problem in the Kn??del graph, Journal of Discrete Algorithms, vol.31, pp.40-47, 2015.
DOI : 10.1016/j.jda.2014.11.008

H. A. Harutyunyan, Minimum multiple message broadcast graphs, Networks, vol.23, issue.4, pp.218-224, 2006.
DOI : 10.1002/net.20110

H. A. Harutyunyan, Multiple message broadcasting in modified Knödel graph, pp.157-165, 2000.

H. A. Harutyunyan and C. D. Morosan, The spectra of Knödel graphs, Informatica, vol.30, pp.295-299, 2006.

H. A. Harutyunyan and C. D. Morosan, On the minimum path problem in Knödel graphs, pp.86-91, 2007.

H. A. Harutyunyan and A. L. Liestman, Upper bounds on the broadcast function using minimum dominating sets, Discrete Math, pp.312-2992, 2012.

S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks, vol.3, issue.4, pp.319-349, 1988.
DOI : 10.1002/net.3230180406

J. Hromkovi?, R. Klasing, B. Monien, and R. Peine, Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping), Combinatorial Network Theory, pp.125-212, 1996.
DOI : 10.1007/978-1-4757-2491-2_5

L. H. Khachatrian and H. S. Haroutunian, Construction of new classes of minimal broadcast networks, Proceedings of the Third International Colloquium on Coding Theory, pp.69-77, 1990.

R. Labahn, Some minimum gossip graphs, Networks, vol.7, issue.4, pp.333-341, 1993.
DOI : 10.1002/net.3230230416

S. and S. Kumar, Decompositions of Graphs into Trails and Cycles