Analytic Odd Mean Labeling Of Some Standard Graphs
Let G=(V,E) be a graph with p vertices and q edges. A graph G is analytic odd mean if there exist an injective function f: V→ {0,1,3,5,…2q-1} with an induce edge labeling f*: E→Z such that for each edge uv with f(u) < f(v), (Formula Presented) is injective. We say that f is an analytic odd mean l...
| Published in: | Palestine Journal of Mathematics |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Palestine Polytechnic University
2019
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85121801652&partnerID=40&md5=3c7c03a5274eed17a3a34808090e83d9 |
| id |
2-s2.0-85121801652 |
|---|---|
| spelling |
2-s2.0-85121801652 Jeyanthi P.; Gomathi R.; Lau G.-C. Analytic Odd Mean Labeling Of Some Standard Graphs 2019 Palestine Journal of Mathematics 8 Special issue 1 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85121801652&partnerID=40&md5=3c7c03a5274eed17a3a34808090e83d9 Let G=(V,E) be a graph with p vertices and q edges. A graph G is analytic odd mean if there exist an injective function f: V→ {0,1,3,5,…2q-1} with an induce edge labeling f*: E→Z such that for each edge uv with f(u) < f(v), (Formula Presented) is injective. We say that f is an analytic odd mean labeling of G. In this paper we prove that path Pn, cycle Cn, complete graph Kn, Wheel graph Wn, complete bipartite graph Km,n, flower graph Fln, ladder graph Ln, comb Pn ⊙ K1, the graph Ln ⊙ K1 and the graph Cm ∪ Cn are analytic odd mean graph. © Palestine Polytechnic University-PPU 2019. Palestine Polytechnic University 22195688 English Article |
| author |
Jeyanthi P.; Gomathi R.; Lau G.-C. |
| spellingShingle |
Jeyanthi P.; Gomathi R.; Lau G.-C. Analytic Odd Mean Labeling Of Some Standard Graphs |
| author_facet |
Jeyanthi P.; Gomathi R.; Lau G.-C. |
| author_sort |
Jeyanthi P.; Gomathi R.; Lau G.-C. |
| title |
Analytic Odd Mean Labeling Of Some Standard Graphs |
| title_short |
Analytic Odd Mean Labeling Of Some Standard Graphs |
| title_full |
Analytic Odd Mean Labeling Of Some Standard Graphs |
| title_fullStr |
Analytic Odd Mean Labeling Of Some Standard Graphs |
| title_full_unstemmed |
Analytic Odd Mean Labeling Of Some Standard Graphs |
| title_sort |
Analytic Odd Mean Labeling Of Some Standard Graphs |
| publishDate |
2019 |
| container_title |
Palestine Journal of Mathematics |
| container_volume |
8 |
| container_issue |
Special issue 1 |
| doi_str_mv |
|
| url |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85121801652&partnerID=40&md5=3c7c03a5274eed17a3a34808090e83d9 |
| description |
Let G=(V,E) be a graph with p vertices and q edges. A graph G is analytic odd mean if there exist an injective function f: V→ {0,1,3,5,…2q-1} with an induce edge labeling f*: E→Z such that for each edge uv with f(u) < f(v), (Formula Presented) is injective. We say that f is an analytic odd mean labeling of G. In this paper we prove that path Pn, cycle Cn, complete graph Kn, Wheel graph Wn, complete bipartite graph Km,n, flower graph Fln, ladder graph Ln, comb Pn ⊙ K1, the graph Ln ⊙ K1 and the graph Cm ∪ Cn are analytic odd mean graph. © Palestine Polytechnic University-PPU 2019. |
| publisher |
Palestine Polytechnic University |
| issn |
22195688 |
| language |
English |
| format |
Article |
| accesstype |
|
| record_format |
scopus |
| collection |
Scopus |
| _version_ |
1812871800293425152 |