Indian Journal of Science and Technology
Year: 2011, Volume: 4, Issue: 4, Pages: 414-416
E.Bala* and K. Thirusangu
In this paper we present an algorithm and show that for any finite j, where j ≥ 3 and 2j – 1 ≤ n, there exists a (n, 2n) 4- regular bimagic graph of girth j with magic constants 4n – (j-2) and 5n – (j-2). AMS Subject classification: 05C78
Keywords: Graph labeling, k-regular graph, girth.
Subscribe now for latest articles and news.