2014
DOI: 10.14445/22315373/ijmtt-v16p506
|View full text |Cite
|
Sign up to set email alerts
|

Few Results on Geometric Mean Graphs

Abstract: A Graph G = (V,E) with p vertices and q edges is said to be a Geometric mean graph if it is possible to label the vertices xV with distinct labels f(x) from 1,2…..q+1 in such a way that when each edge e=uv is labeled with f(e=uv) = (or) , then the resulting edge labels are all distinct. In this case, f is called Geometric mean labeling of G. In this paper we prove that,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 2 publications
0
4
0
Order By: Relevance
“…Deshmukh and Shaikh discussed detailed Geometric mean graph results from various corona graphs [1]. The authors have discussed combining two graphs which admit the Geometric mean.…”
Section: Review Of Literaturementioning
confidence: 99%
“…Deshmukh and Shaikh discussed detailed Geometric mean graph results from various corona graphs [1]. The authors have discussed combining two graphs which admit the Geometric mean.…”
Section: Review Of Literaturementioning
confidence: 99%
“…For all other standard terminology and notations we follow Harary [3]. In [6] Somasundaram and Ponraj introduced and studied [9] mean labeling for some standard graphs. Sandhya and Somasundaram [5] introduced Harmonic mean labeling of graphs and Sandhya et al [4] studied the technique in detail.…”
Section: Introductionmentioning
confidence: 99%
“…Also we discuss some properties and eulerianity of total blitact graph, full graph and middle blict graph of a graph. Many other graph valued functions in graph theory were studied, for example, in [7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23].…”
Section: Introductionmentioning
confidence: 99%