International Journal of Mathematics Trends and Technology
Volume 34 | Number 2 | Year 2016 | Article Id. IJMTT-V34P513 | DOI : https://doi.org/10.14445/22315373/IJMTT-V34P513
Hamilton decomposition is one of the earliest concepts in the field of graph theory. The Hamilton decomposability problem plays a vital role in the study of Combinatorial Design theory. A Harary graph Hk,n is a k-connected simple graph with n vertices and with a minimal number of edges. Constructing Harary graphs and learning about their connectivity is considered to be one of those typical mathematical topics. In fact, the connectivity of Harary graphs addresses a very relevant question in communication networks: trading off the costs between reliability and the number of communication links. In this paper, we investigate the Hamilton decomposition of Harary graphs and its minimum bound for Hamilton decomposition.
[1] Albert Williams, Shanthakumari.A, Bound on minimum cycle cover number of a graph, J. Comp. & Math. Sci., Pages 842-845, Vol. 2, No. 6, 2011
[2] Albert Williams, Shanthakumari.A, Minimum cycle cover of Butterfly and Benes network, International Journal of Mathematics and Soft Computing, Pages 93-98, Vol. 2, No. 1, 2012
[3] Anitha R., Lekshmi R. S., N – Sun Decomposition of Complete, Complete Bipartite and some Harary Graphs, Internatioanal Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering, Article 7, Vol. 2, 2008
[4] Arumugam S., Shahul Hamid I., Abraham V. M., Decomposition of Graphs into Paths and Cycles, Journal of Discrete Mathematics, Page 10.1155, Vol. 2013, 2013
[5] Dolober Froneck, Decomposition of Complete Graphs to small graphs, Opuscula Mathematica, Page 277, Vol. 30, 2010
[6] Harary.F, Graph Theory, Page 163, 1969
[7] Harary.F, Maximum Connectivity of a Graph, Mathematics, Pages 1142-1146, Vol. 48, 1962
[8] Hilton A. J. W., Hamilton Decompositions of Complete Graphs, Journal of Combinatorial Theory, Pages 125 – 134, Vol. B 36, 1984
[9] Indra Rajasingh, Albert Williams, et al., Shanthakumari.A, Edge-isometric problem for Sierpinski gasket graphs, International Journal of Pure and Applied Mathematics, Pages717-726, Vol. 101, No. 5, 2015
[10] Maarten Van Steen, An Introduction to Graph theory and Complex Networks, Pages 2.25-2.26, 2010
[11] Nash Williams C. St. J. A., Infinite graphs – A survey, Journal of Combinatorial Theory, Pages 286 – 301, Vol. 3, 1967
[12] Olivier Baudon, Julien Bensmail, Eric Sopena, Partitioning Harary graphs into connected Subgraphs containing prescribed vertices, Discrete Mathematics and Theoritical Computer Science, Pages 263-278, Vol. 16:3, 2014
[13] Shahul Hamid I., Abraham V. M., Decomposition of Graphs into Induced Paths and Cycles, Internatioanal Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering, Article 11, Vol. 3, 2009
[14] Tay – Woei Shyu, Decomposition of Complete Graphs into Paths and Stars, Discrete Mathematics, Page 310, 2164 – 2169, 2010
[15] Tillson T. W., A Hamiltonian Decomposition of , J.Combin.Theory, Pages 68 – 74, Vol. B 29, 1980
Jude Annie Cynthia, N. R. Swathi, "Hamilton Decomposition of Harary Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 34, no. 2, pp. 59-63, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V34P513
PDF 
Abstract 
Keywords 
References 
Citation