Hamiltonian Laceability in the Interleaver Graph of the Brick Product Graph C (2n,1,5)
R. A. Daisy Singh1, R. Murali2

1R. A. Daisy Singh, Assistant Professor, Department of Mathematics, B.N.M. Institute of Technology, Bengaluru (Karnataka), India.
2R. Murali, Professor, Department of Mathematics, Dr. Ambedkar Institute of Technology, Bengaluru (Karnataka), India.
Manuscript received on 29 March 2019 | Revised Manuscript received on 08 April 2019 | Manuscript Published on 27 April 2019 | PP: 856-863 | Volume-7 Issue-6S2 April 2019 | Retrieval Number: F10930476S219/2019©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: A good interleaver for turbo codes can be constructed from 3-regular hamiltonian graphs having large girth. The girth of a graph is the shortest cycle contained in a graph. In topological point of view it is important for any interconnection network to have various graph theoretic properties which includes girth. Turbo codes are used in 3G/4G mobile communications and in satellite communications. Also, interleavers have been used in communication systems for a long time. The classical use of interleaver is to randomise the location of errors. In this paper we present a construction of interleaver graphs N IG from the brick product graph C (2n,1,5) and explore its Hamiltonian laceability properties.
Keywords: Brick Product Graphs, Fault Tolerance, Hamiltonian Laceability, Interleaver Graph.
Scope of the Article: Cryptography and Applied Mathematics