ON F-FACE MAGIC MEAN LABELING OF
SOME DUPLICATED GRAPHS

Abstract

In this paper we introduce the F-face magic mean labeling of planar graphs, an assignment of labels to the edges which induces an assignment of labels to the faces of a graph such that the mean weight of each face is constant. We discuss about the F-face magic mean labelings of some duplicated graphs.

Citation details of the article



Journal: International Journal of Applied Mathematics
Journal ISSN (Print): ISSN 1311-1728
Journal ISSN (Electronic): ISSN 1314-8060
Volume: 31
Issue: 2
Year: 2018

DOI: 10.12732/ijam.v31i2.5

Download Section



Download the full text of article from here.

You will need Adobe Acrobat reader. For more information and free download of the reader, please follow this link.

References

  1. [1] N. Hartsfield and G. Ringel, Pearls in Graph Theory, Academic Press, San Diego, 1990.
  2. [2] W.D. Wallis, Magic Graphs, Birkhäuser, Boston-Basel-Berlin, 2001.
  3. [3] K.M. Kathiresan and R. Ganesan, A labeling problem on the plane graph Pa,b , Ars Combin., 73 (2004), 143–151.
  4. [4] J.A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 5 (2005), # DS6.
  5. [5] P. Jeyanthi and A. Maheswari, Vertex equitable labling of cycle and path related graphs, Utilitas Mathematica, 98 (2015), 215–226.
  6. [6] R. Vasuki and S. Arokiaraj, On odd mean graphs, Journal of Discrete Mathematical Sciences and Cryptography, To appear.