Geometric mean labeling of subdivision on some graphs

Somasundaram, S.; Sandhya, S. S.; Viji, P.

doi:10.5958/2320-3226.2015.00004.1

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction4

Literature Survey1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2015

2020

Publication Types

Select...

Article5

Other1

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 8 publications

(10 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A dynamic survey of graph labelings is gathered by (Gallian, 2010). The concept of Mean Labeling was introduced by (Somasundaram et al, 2003). Some new families of Mean graphs are discussed in (Vaidya and Bijikumar, 2010a;.…”

Section: Literature Surveymentioning

confidence: 99%

Existence and Non-Existence of Super Mean Labeling on Star Graphs

Maheswari

Obaiys²,

Jebarani

et al. 2020

American Journal of Engineering and Applied Sciences

View full text Add to dashboard Cite

show abstract

Section: Literature Surveymentioning

confidence: 99%

Existence and Non-Existence of Super Mean Labeling on Star Graphs

Maheswari

Obaiys²,

Jebarani

et al. 2020

American Journal of Engineering and Applied Sciences

View full text Add to dashboard Cite

show abstract

“…We will provide short summary and definitions which are useful for the present investigation. The notion of "Geometric mean Labeling" has introduced by S. Somasundaram, Rand Ponraj, P. Vidhyarani [6]. S. Somasundaram and R. Ponraj introduced "Mean Labeling" [3].…”

Section: Introductionmentioning

confidence: 99%

Some results on super Heronian mean labeling of graphs

Sandhya¹,

Merly²,

Jemi³

2016

ijcms

View full text Add to dashboard Cite

show abstract

“…Geometric mean labeling was first introduced by Somasundaram et al (2011) in [2]. Many classes of geometric mean graphs are studied in [2], [3], [4], [5], [6], and [7].…”

Section: Introductionmentioning

confidence: 99%

$k$-geometric graphs

Rochanakul¹

2016

Preprint

View full text Add to dashboard Cite

A finite, simple and undirected graph G = (V, E) with p vertices and q edges is said to be a k-geometric mean graph for a positive integer k if there is an injection ψ :The special case k = 1, a 1-geometric mean labeling is called a geometric mean labeling, and a 1-geometric mean graph is called a geometric mean graph.In this paper, we present new classes of geometric mean graphs. Then we introduce k-geometric mean labeling and prove some classes of graphs are k-geometric mean. We also study some classes of finite join of graphs that admit geometric mean labeling.

show abstract

Geometric mean labeling of subdivision on some graphs

Cited by 8 publications

References 0 publications

Existence and Non-Existence of Super Mean Labeling on Star Graphs

Existence and Non-Existence of Super Mean Labeling on Star Graphs

Some results on super Heronian mean labeling of graphs

$k$-geometric graphs

Contact Info

Product

Resources

About