Heronian mean labeling of graphs

Abstract

A function f is called a Heronian Mean Labeling of a graph G = (V,E) with p vertices and q edges if it is possible to label the vertices Î with distinct labels () from 1,2,..,q+1 in such a way that when each edge = is labeled with (=) = ⌈ () + √ () () + () ⌉ () ⌊ () + √ () () + () ⌋ then the edge labels are distinct. In this case, f is a Heronian mean labeling of G and G is called a Heronian Mean Graph. In this paper, we prove that Path,

Perturbation-Iteration Method for Solving Mathematical Model of Hypoxemic Hypoxia Tissue-Blood Carbon Dioxide Exchange during Physical Activity Activity

“…The notion of Heronian Mean labeling was introduced by S.S.Sandhya, E.Ebin Raja Merly and S.D.Deepa and the Heronian Mean labeling behavior of Path , Cycle , Star K 1,n , Triangular Snake T n , Quadrilateral Snake Q n , Comb , ladder , Step Ladder, Crown, Complete graph has been investigated in [5] and [6]. In this paper we contribute some new results for Heronian Mean labeling of graphs.…”

K-Graceful, Odd-Even Graceful, Heronian Mean and Analytic Mean Labeling for the Extended Duplicate Graph of Kite Graph

“…For more related results on duplicate graphs we refer some articles [6,7]. The concept of heronian mean and analytic mean labeling was studied and refer [8,9]. The present work is aimed to prove K-graceful ,Odd-Even graceful, Heronian mean, Analytic mean labeling for the extended duplicate graph of kite graph.…”

More Results on Subdivision of Heronian Mean Labeling of Graphs

“…S.Somasundaram and S.S.Sandhya introduced Harmonic mean labeling [4] in 2012. Motivated by the above works we introduced a new type of labeling called Heronian Mean Labeling in [5].…”