Root Cube even Mean Labeling of Graph
Year: 2023
Type: article
Abstract: A graph G = (V,E) with p vertices and q edges is said to be a Root Cube Even Mean Graph if it is possible to label the vertices x V with distinct elements f(x) from 1,2......,q+1 in such a way that when each edge e = uv is labeled with , then the resulting edge labels are distinct. Here f is called a Root Cube Even Mean Labeling of G. In this paper we prove that path, comb, Pn?K1,2 is a root cube even Mean Labeling graph.
Authors: P. Shalini, D. Madhumitha
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4380050488