Journal of
Engineering and Technology Research

  • Abbreviation: J. Eng. Technol. Res.
  • Language: English
  • ISSN: 2006-9790
  • DOI: 10.5897/JETR
  • Start Year: 2009
  • Published Articles: 184

Full Length Research Paper

Polygon graphs of Girth 6

Shoaib U. Din1 and Khalil Ahmad2*
1Department of Mathematics, University of the Punjab Lahore, Pakistan. 2Department of Mathematics, University of Management and Technology, Lahore, Pakistan.
Email: [email protected]

  • Article Number - 41D5EAB11824
  • Vol.3(6), pp. 197-202, June 2011
  •  Accepted: 30 March 2011
  •  Published: 30 June 2011

Abstract

This paper introduces a family of simple bipartite graphs denoted by , named and constructed as polygon graphs. These polygon graphs are bicubic simple graphs possessing Hamiltonian cycles. Some important results are proved for these graphs. The girth of these graphs is counted as 6().  Polygon graph is isomorphic to a famous Pappus graph. Since polygon graphs are bipartite, therefore they can be used as Tanner graphs for low density parity check codes. This family of graphs may also be used in the design of efficient computer networks. 

Key words: Polygon graph, girth, Hamiltonian cycle, bicubic graph.

  • Articles on Google by: