Further results on even vertex odd mean graphs

Let $G$ be a graph with $p$ vertices and $q$ edges. A total graph labeling $ f:V(G)\bigcup E(G)\rightarrow \{0,1,2,3,...,2q\}$ is called even vertex odd mean labeling of a graph $G$ if the vertices of the graph $G$ label by distinct even integers from the set $\{0,2,...,2q\}$ and the labels of the edges are defined as the mean of the labels of its end vertices and these labels are $2q-1$ distinct odd integers from the set $\{1,3,5,...,2q-1\}$. In this paper we investigate the even vertex odd mean labeling of uniform theta graphs.

Section: Introductionmentioning

confidence: 99%

Even vertex odd mean labeling of uniform theta graphs

Basher

2024

“…A graph which allows an even-odd meanness is said to be an even-odd mean graphs [1,2,3,7,11]. Consider a and b are two integers, then we refer [a, b] to be an interval of integers c, where a ≤ c ≤ b.…”

Section: Introductionmentioning

confidence: 99%

On even-odd meanness of super subdivision of some graphs

Basher

Siddiqui

2022

Self Cite

Graph Labeling is a significant area of graph theory that is used in a variety of applications like coding hypothesis, x-beam crystallography, radar, cosmology, circuit design, correspondence network tending to, and database administration. This study provides a general overview of graph naming in heterogeneous fields, however it primarily focuses on graph subdivision. The even vertex odd meanness of super subdivide of various graphs is discussed in this study. The graphs generated by super subdivided of path, cycle, comb, crown, and planar grid are even-odd mean graphs, according to our proof.

“…A graph G , which admits an even vertex odd mean labeling is called an even vertex odd mean graph. For more studies see [3,4]. Definition 1.2.…”

Section: Introductionmentioning

confidence: 99%

On even vertex odd mean labeling of the calendula graphs

Basher

2020

Self Cite

A graph G with |E(G)| = q, an injective function f : V (G) → {0, 2, 4, ..., 2q} is an even vertex odd mean labeling of G that induces the values f(u)+f(v) 2 for the q pairs of adjacent vertices u, v are distinct. In this paper, we investigate an even vertex labeling for the calendula graphs. Moreover we introduce the definition of arbitrary calendula graph and prove that the arbitrary calendula graphs are also even vertex odd mean graphs.