Indian Journal of Science and Technology

Open Access Open Access  Restricted Access Subscription Access

On Bi-magic Labeling of 4-regular Graphs


Affiliations
1 Department of mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai-600073, India
 

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).

Keywords

Graph Labeling, K-regular Graph, Girth
User

  • Baca M, Lin Y, Miller M and Simanjuntak R (2001) New constructions of magic and antimagic graph labeling. Utilitas Mathematica. 60, 229-239.

  • Baskar Babujee J (2004) Bimagic Labelling on Path Graphs. J. Math. Edu.38(1),12-16.

  • Gallian JA (2009) A dynamic surevey of graph labeling. Elec. J. Combinatorics. 16, DS6.

  • Hartsfield N and Ringel G (1990) Pearls in graph theory, Academic press, San Diego.

  • Rosa A (1967) On certain valuations of the vertices of a graph, Theory of graphs, Int. Symp., Rome, July 1996, Gordon and Breach NY and Dunod Paris (1967).pp:349-355.

  • Thirusangu K, Baskar Babujee J and Rajeswari R (2009) On antimagic labelings in Cayley’s digraphs. Int. J. Mathematics Appl. 2(1-2), 11-16.


Abstract Views: 436

PDF Views: 115




  • On Bi-magic Labeling of 4-regular Graphs

Abstract Views: 436  |  PDF Views: 115

Authors

E. Bala
Department of mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai-600073, India
K. Thirusangu
Department of mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai-600073, India

Abstract


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).

Keywords


Graph Labeling, K-regular Graph, Girth

References





DOI: https://doi.org/10.17485/ijst%2F2011%2Fv4i4%2F30012