Even Vertex Odd Edge Root Square Mean Labelling Of Path Related Graphs

Even Vertex Odd Edge Root Square Mean Labelling Of Path Related Graphs K. N. Babu

Consider G be a graph with p vertices and q edges. A graph G is said to be even vertex odd edge root square mean labelling if there exist an injective map f :V(G)→{0,1,2,3,…,2q} such that the induced edge labels are odd and distinct which can be obtained by f^(* ) (e)=⌈√((〖f(u)〗^2 +〖f(v)〗^2)/2)⌉ or ⌊√((〖f(u)〗^2 +〖f(v)〗^2)/2)⌋. Any graph which admits even vertex odd edge root square mean labelling then it is called as even vertex odd edge root square mean labelling graph.
11 20 2024 296 303 10.52783/cana.v32.2401 https://internationalpubls.com/index.php/cana/article/view/2401 https://internationalpubls.com/index.php/cana/article/download/2401/1466 https://internationalpubls.com/index.php/cana/article/download/2401/1466