skip to main content

ON EVEN-TO-ODD MEAN LABELING OF SOME TREES

*Leomarich F Casinillo  -  Visayas State University, Philippines

Citation Format:
Abstract

Let G=(V(G), E(G)) be a connected graph with order |V(G)|=p and size |E(G)|=q. A graph G is said to be even-to-odd mean graph if there exists a bijection function phi:V(G) to {2, 4, ..., 2p}  such that the induced mapping phi^*:E(G) to {3, 5, ..., 2p-1} defined by phi^*(uv)=[phi(u)+phi(v)]/2 for all uv element of E(G) is also bijective. The function  is called an even-to-odd mean labeling of graph . This paper aimed to introduce a new technique in graph labeling. Hence, the concepts of even-to-odd mean labeling has been evaluated for some trees. In addition, we examined some properties of tree graphs that admits even-to-odd mean labeling and discussed some important results.

Fulltext View|Download
Keywords: Trees, even-to-odd mean labeling, even-to-odd mean graph

Article Metrics:

  1. Bollobás, B. (1998). Modern graph theory. Springer-Verlag, New York
  2. Casinillo, L. F. (2018). A note on Fibonacci and Lucas number of domination in path. Electronic Journal of Graph Theory and Applications, 6(2), 317–325
  3. Casinillo, L. F. (2020a). Odd and even repetition sequences of independent domination number. Notes on Number Theory and Discrete Mathematics, 26(1), 8-20
  4. Casinillo, L. F., Lagumbay, E. T. & Abad, H. R. F. (2017). A note on connected interior domination in join and corona of two graphs. IOSR Journal of Mathematics, 13(2), 66–69
  5. Casinillo, L. F. (2020b). Some new notes on Mersenne primes and perfect numbers. Indonesian Journal of Mathematics Education, 3(1), 15-22
  6. Chartrand, G. and Zhang, P. (2012) A First Course in Graph Theory. Dover Publication, Inc., New York
  7. Gallian, J.A. (2014). A dynamic survey of graph labeling. The Electronic Journal of Combinatorics, 17, 60-62
  8. Gayathri, B. & Gopi, R. (2014). Cycle related mean graphs. Elixir International Journal of Applied Sciences, 71, 25116-25124
  9. Kumar, M. K., Murali, R. & Chidanandan, V. (2016). Domination in some classes of ditrees. Bulletin of the International Mathematical Virtual Institute, 6, 157-167
  10. Manickam, K. & Marudai, M. (2006). Odd mean Labeling of graphs. Bulletin of Pure and Applied Sciences, 25(1), 149-153
  11. Ore, O. (1962). Theory of Graphs. American Mathematical Society Provedence, R. I
  12. Ponraj, R. & Somasundaram, S. (2003). Mean Labeling of graphs. National Academy Science Letter, 26, 210-213
  13. Varkey, M. T. K. & Thomas, M. S. (2017). Some tree and tree related cubic graceful graphs. International Journal of Advanced Scientific and Technical Research, 7(4), 239-244
  14. Vasuki, R., Nagarajan, A. & Arockiaraj, S. (2013). Even vertex odd mean labeling of graphs, Sut. J. Math, 49(2), 79-92

Last update:

No citation recorded.

Last update:

No citation recorded.