A PROPERLY EVEN HARMONIOUS LABELING OF SOME WHEEL GRAPH Wn FOR n IS EVEN

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

A properly even harmonious labeling of a graph G with q edges is an injective mapping f from the vertices of graph G to the integers from 0 to 2q − 1 such that induces a bijective mapping f* from the edges of G to {0,2, …,2q − 2} defined by f*(vi vj) = (f(vi) + f(vj))(mod2q). A graph that has a properly even harmonious labeling is called a properly even harmonious graph. In this research, we will show the existence of a properly even harmonious labeling of some wheel graph Wn for n is even.

Cite

CITATION STYLE

APA

Nisa, F., Fathoni, M. I. A., & Brata, A. S. (2024). A PROPERLY EVEN HARMONIOUS LABELING OF SOME WHEEL GRAPH Wn FOR n IS EVEN. Barekeng, 18(1), 0553–0564. https://doi.org/10.30598/barekengvol18iss1pp0553-0564

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free