On the construction of new classes of super mean graphs

Vasuki, R.; Nagarajan, A.

doi:10.1080/09720529.2010.10698293

Cited by 9 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The concept of super mean labeling was introduced and studied by D. Ramya,. The super meanness property of the subdivision of the H-graph and slanting ladder was studied by R.Vasuki and A. Nagarajan [8] and super meanness of sub division graph of K1,3, some caterpillars and some duplicate graphs were studied by R. Vasuki and A. Nagarajan [9][10][11][12]. The communication becomes very much limited between the sender and the receiver and not to be understood by others.…”

Section: Literature Reviewmentioning

confidence: 99%

A Method of Secret Coding technique on Two Star Graphs

Maheswari¹,

Arthy²,

Jabbar³

2020

IJCA

View full text Add to dashboard Cite

Super Mean Labeling is one the interesting topic in graph theory. There also are search that has proved that the super mean labeling is not possible forth the star graphs. In this paper, we generalized the concept of super mean labeling on two star graphs and develop a technique of coding a secret messages using two star graph through super mean labeling. Two types of coding, picture and matrix coding have been illustrated by using different types of numbering of alphabets and algorithm is established.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A Method of Secret Coding technique on Two Star Graphs

Maheswari¹,

Arthy²,

Jabbar³

2020

IJCA

View full text Add to dashboard Cite

show abstract

“…The disjoint union of two star K 1, m and K 1, n is denoted by K 1, m ∪ K 1, n . The wedge of two star is obtained by an edge joining two first copy and second copy of two star for all u i and v j such that f (u i )+f (v j )+1 2 = 2m + 2.Much work is done by researchers on super mean labeling applying it on a variety of graphs [4], [5], [6], [7], [8]. Motivated by these work, we have struck at the concept of super mean labeling on any two star graph.…”

Section: Introductionmentioning

confidence: 99%

Limit on Connected Two Star Super Mean Graphs

Maheswari

Balaji

2018

View full text Add to dashboard Cite

Let G be a (p, q) graph and f : V (G) → {1, 2, 3, , p + q} be an injection. For each edge e = uv, let f * (e) = f (u) + f (v) 2 if f (u) + f (v) is even and f * (e) = f (u) + f (v) + 1 2 if f (u) + f (v) is odd. Then f is called super mean labeling if f(V) ∪ {f * (e) : e ∈ E(G)} = {1, 2, 3, , p + q}. A graph that admits a super mean labeling is called a super mean graph. In this paper we with an edge in common is a super mean graph if and only if |m − n| ≤ 1.

show abstract

Section: Introductionmentioning

confidence: 99%