Mean Cordial Labeling of Graphs

Ponraj, R.; Sivakumar, Muthirulan; Sundaram, M. Shumuga

doi:10.4236/ojdm.2012.24029

Cited by 27 publications

(24 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…S. Somasundram and R. Ponraj introduced mean labeling of graphs in [3]. R. Ponraj and D. Ramya introduced Super mean labeling of graphs in [4]. S. Somasundram and S.S. Sandhya introduced the concept Harmonic mean labeling in [5] and studied their behavior in [6,7,8].…”

Section: Introductionmentioning

confidence: 99%

Some Results on Super Harmonic Mean Graphs

Raj¹,

Jayasekaran²

2014

IJMTT

View full text Add to dashboard Cite

Let G be a graph with p vertices and q edges. Let f: V(G) → {1, 2, …, p + q} be a injective function. For a vertex labeling f, the induced edge labeling f * (e = uv) is defined by f * (e) = () () () () or () () () (). Then f is called a Super harmonic mean labeling if f(V(G))∪{f(e) / e ϵ E(G)} = {1, 2, …, p + q}. A graph which admits Super harmonic mean labeling is called Super harmonic mean graphs. In this paper, we investigate Super harmonic mean labeling of some graphs.

show abstract

Section: Introductionmentioning

confidence: 99%

Some Results on Super Harmonic Mean Graphs

Raj¹,

Jayasekaran²

2014

IJMTT

View full text Add to dashboard Cite

show abstract

“…The concept of mean labeling was introduced by S. Somasundaram and R. Ponraj in [5] and further studied in [6][7][8]. A. Lourdusamy and M. Seenivasan introduced a vertex equitable labeling in [9].…”

mentioning

confidence: 99%

Some Results on Vertex Equitable Labeling

Jeyanthi¹,

Maheswari²

2012

OJDM

View full text Add to dashboard Cite

Let G be a graph with p vertices and q edges and let A= vertex labeling is said to be a vertex equitable labeling of G if it induces an edge labeling given by such that and , where is the number of vertices v with for A graph G is said to be a vertex equitable graph if it admits vertex equitable labeling. In this paper, we establish the vertex equitable labeling of a Tp-tree, where T is a Tp-tree with even number of vertices, bistar the caterpillar and crow

show abstract

“…For all detailed survey of graph labeling we refer to Gallian [1]. For all other standard terminology and notations we follow Harary [2].The concept of mean labeling has been introduced by S.Somasundaram and R.Ponraj in 2004 [3].Motivated by the above works we introduce a new type of labeling called Root Square Mean labeling. In this paper we investigate the Root Square Mean labeling of Path, Cycle, Comb, Ladder, Triangular Snake, Quadrilateral Snake, Complete graph, Star.…”

Section: Introductionmentioning

confidence: 99%