1 July 1998 in Pattern Recognition Letters
1 February 2010 in International Journal of Heat and Mass Transfer
3 March 2016 in Journal of Discrete Mathematical Sciences and Cryptography
A Graph G = (V, E) with p vertices and q edges is said to be a Geometric mean graph if it is possible to label the vertices xϵV with distinct labels f(x) from 1, 2 … … … … q + 1 in such a way that when each edge e = uv is labeled with f (e = uv) = ⌈ f (u) f (v)⌉ or ⌊ f (u) f (v)⌋, then the resulting edge labels are distinct. In this case, f is called Geometric mean labeling of G. In this paper we study the Geometric mean labeling on Degree Splitting graphs.
27 January 2016 in International Journal of Mathematics and Soft Computing
Let $G$ be a $(p,q)$ graph and $f:V(G)\leftarrow \{1,2,3,…,p+q \}$ be an injective function. For each edge $e=uv$ , let $f^*(e=uv)=\lceil \sqrt{\frac{f(u)^2+f(v)^2}{2}} \rceil$ or =\lfloor\sqrt{\frac{f(u)^2+f(v)^2}{2}} \rfloor$, then $f$ is called a super root square mean labeling if $f(V) \cup \{f^*(e):e \in E(G) \}=\{1,2,…,p+q \}. A graph that admits a super root square mean labeling is called as super root square mean graph. In this paper we prove that Double triangular snake, Alternate double triangular snake, Double quadrilateral snake and Alternate Double quadrilateral snake graphs are super root square mean graphs. Keywords: Root Square mean graph, Super Root Square mean graph, Triangular snake, Double triangular snake, Quadrilateral snake, Double quadrilateral snake.
3 April 2019 in Journal of Discrete Mathematical Sciences and Cryptography
A graph G = (V, E) with p vertices and q edges is said to be a mean graph if it is possible to label the vertices x ϵ V with distinct elements f (x) from 0, 1, 2, … , q in such a way that when each edge e = uv is labeled with if f (u) + f (v) is even and if f (u) + f (v) is odd, then the resulting edge labels are distinct. In this case f is called a mean labeling of G. In this paper we prove that Triangular Ladder TLn, TLn, ʘ K1, Tn, ʘ K1, D(Tn) ʘ K1, Qn ʘ K1, D(Qn) ʘ K1 are mean graphs.