Answers are grounded in this paper and cite their sources.
Let G be a graph with p vertices and q edges. A total graph labeling f:V(G) E(G)→ \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.
No takes yet. Share an insight, caveat, or question.
M. Basher (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: