k-equitable mean labeling

author

  • P. Jeyanthi Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur- 628 215,India
Abstract:

This article doesn't have abstract

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

k-odd mean labeling of prism

‎a $(p‎,‎q)$ graph $g$ is said to have a $k$-odd mean‎ ‎labeling $(k ge 1)$ if there exists an injection $f‎ : ‎v‎ ‎to {0‎, ‎1‎, ‎2‎, ‎ldots‎, ‎2k‎ + ‎2q‎ - ‎3}$ such that the‎ ‎induced map $f^*$ defined on $e$ by $f^*(uv) =‎ ‎leftlceil frac{f(u)+f(v)}{2}rightrceil$ is a‎ ‎bijection from $e$ to ${2k - ‎‎‎1‎, ‎2k‎ + ‎1‎, ‎2k‎ + ‎3‎, ‎ldots‎, ‎2‎ ‎k‎ + ‎2q‎ - ‎3}$‎. ‎a graph that admits $k$...

full text

Vertex Equitable Labeling of Double Alternate Snake Graphs

Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...

full text

3-Equitable Prime Cordial Labeling of Graphs

A 3-equitable prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |} such that if an edge uv is assigned the label 1 if gcd(f(u), f(v)) = 1 and gcd(f(u) + f(v), f(u)−f(v)) = 1, the label 2 if gcd(f(u), f(v)) = 1 and gcd(f(u) + f(v), f(u)− f(v)) = 2 and 0 otherwise, then the number of edges labeled with i and the number of edges labeled with j differ b...

full text

Some Results on Vertex Equitable Labeling

Let G be a graph with p vertices and q edges and let = 0,1, 2, , . 2 q A              A vertex labeling   : f V G A  i e a vertex equitable labeling of G if it induces an edge labeling s said to b given by      * =  f uv f u f v  * f such that     1 v a v b   and     * = 1,2,3, , f f f E q  , where   f v a is the ber of verti num ces v with   = f v a for . ...

full text

Further results on total mean cordial labeling of graphs

A graph G = (V,E) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : V (G) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ V (G), xy ∈ E(G), and the total number of 0, 1 and 2 are balanced. That is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). In thi...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 44  issue 1

pages  21- 30

publication date 2013-07-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023