Some Results on Super Root Square Mean Labeling

Sandhya, S. S.; Somasundaram, S.; Anusa, S.

doi:10.26708/ijmsc.2016.1.6.15

Cited by 2 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For all other standard terminology and notations we follow Harary [2]. S.S.Sandhya ,S.Somasundaram and S.Anusa introduced the concept of Root Square Mean labeling of graphs in [4] and studied their behavior in [5] , [6], and [7].In this paper we investigate the Root Square mean labeling of some disconnected graphs. We now give the definitions which are useful for the present study.…”

Section: Introductionmentioning

confidence: 99%

Root Square mean labeling of some more disconnected graphs

Sandhya¹,

Somasundaram²,

Anusa³

2015

imf

Self Cite

View full text Add to dashboard Cite

A graph = (,) with vertices and edges is called a Root Square Mean graph if it is possible to label the vertices with distinct labels () from 1,2, … , + 1 in such a way that when each edge = is labeled with (=) = ⌈√ () 2 + () 2 2 ⌉or ⌊√ () 2 + () 2 2 ⌋ , then the edge labels are distinct. In this case is called a Root Square Mean labeling of. In this paper we prove that some disconnected graphs are Root Square Mean graphs.

show abstract

Section: Introductionmentioning

confidence: 99%

Root Square mean labeling of some more disconnected graphs

Sandhya¹,

Somasundaram²,

Anusa³

2015

imf

Self Cite

View full text Add to dashboard Cite

show abstract

Root square mean labelling of some graphs obtained from path

Ramdani

Fanisa

Gumilar

et al. 2021

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

Let G be a graph with q edges. A labelling f of G is said to be root square mean labelling if f: V(G)UE(G)→{1,2,…,q+1} such that when each edge e = uv labelled with f(e)=[f(u)2+f(v)2/2] or f(e)=[f(u)2+f(v)2/2] then the resulting edge labels are distinct. A graph G is called a root square mean graph if G can be labelled by a root square mean labelling. In this paper we determine a root mean square labelling of two graphs obtained from path, which are corona product of ladder and complete graph with order 1, and a graph obtained from triangular snake by join one vertex with degree 2 in each triangle to a new vertex. The method of labelling construction is we need to do labeling to the vertices of the graph with label 1, 2, 3, …, q+1. The labels of the vertices are not necessarily different. The next step is we need to do labeling to the edges with the certain formula by using the vertex labeling. The edge labels must be different. By the labelling we construct, we proof that the two graphs are root square mean graphs.

show abstract

Some Results on Super Root Square Mean Labeling

Cited by 2 publications

References 5 publications

Root Square mean labeling of some more disconnected graphs

Root Square mean labeling of some more disconnected graphs

Root square mean labelling of some graphs obtained from path

Contact Info

Product

Resources

About