Analytic odd mean labeling of union and identification of some graphs

A graph G is analytic odd mean if there exist an injective function f: V → {0, 1, 3,…, 2q − 1} with an induced edge labeling f*: E → Z such that for each edge uv with f (u) < f (v), (Formula Presented) is injective. Clearly the values of f* are odd. We say that f is an analytic odd mean labeling...

وصف كامل

التفاصيل البيبلوغرافية
الحاوية / القاعدة:Proyecciones
المؤلف الرئيسي: Jeyanthi P.; Gomathi R.; Lau G.C.; Shiu W.C.
التنسيق: مقال
اللغة:English
منشور في: Universidad Catolica del Norte 2023
الوصول للمادة أونلاين:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85173043620&doi=10.22199%2fissn.0717-6279-3505&partnerID=40&md5=a2668e38f0cb3ee499c23ab9f7b9a837
id 2-s2.0-85173043620
spelling 2-s2.0-85173043620
Jeyanthi P.; Gomathi R.; Lau G.C.; Shiu W.C.
Analytic odd mean labeling of union and identification of some graphs
2023
Proyecciones
42
5
10.22199/issn.0717-6279-3505
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85173043620&doi=10.22199%2fissn.0717-6279-3505&partnerID=40&md5=a2668e38f0cb3ee499c23ab9f7b9a837
A graph G is analytic odd mean if there exist an injective function f: V → {0, 1, 3,…, 2q − 1} with an induced edge labeling f*: E → Z such that for each edge uv with f (u) < f (v), (Formula Presented) is injective. Clearly the values of f* are odd. We say that f is an analytic odd mean labeling of G. In this paper, we show that the union and identification of some graphs admit analytic odd mean labeling by using the operation of joining of two graphs by an edge. © (2023), (SciELO-Scientific Electronic Library Online). All Rights Reserved.
Universidad Catolica del Norte
7160917
English
Article
All Open Access; Gold Open Access
author Jeyanthi P.; Gomathi R.; Lau G.C.; Shiu W.C.
spellingShingle Jeyanthi P.; Gomathi R.; Lau G.C.; Shiu W.C.
Analytic odd mean labeling of union and identification of some graphs
author_facet Jeyanthi P.; Gomathi R.; Lau G.C.; Shiu W.C.
author_sort Jeyanthi P.; Gomathi R.; Lau G.C.; Shiu W.C.
title Analytic odd mean labeling of union and identification of some graphs
title_short Analytic odd mean labeling of union and identification of some graphs
title_full Analytic odd mean labeling of union and identification of some graphs
title_fullStr Analytic odd mean labeling of union and identification of some graphs
title_full_unstemmed Analytic odd mean labeling of union and identification of some graphs
title_sort Analytic odd mean labeling of union and identification of some graphs
publishDate 2023
container_title Proyecciones
container_volume 42
container_issue 5
doi_str_mv 10.22199/issn.0717-6279-3505
url https://www.scopus.com/inward/record.uri?eid=2-s2.0-85173043620&doi=10.22199%2fissn.0717-6279-3505&partnerID=40&md5=a2668e38f0cb3ee499c23ab9f7b9a837
description A graph G is analytic odd mean if there exist an injective function f: V → {0, 1, 3,…, 2q − 1} with an induced edge labeling f*: E → Z such that for each edge uv with f (u) < f (v), (Formula Presented) is injective. Clearly the values of f* are odd. We say that f is an analytic odd mean labeling of G. In this paper, we show that the union and identification of some graphs admit analytic odd mean labeling by using the operation of joining of two graphs by an edge. © (2023), (SciELO-Scientific Electronic Library Online). All Rights Reserved.
publisher Universidad Catolica del Norte
issn 7160917
language English
format Article
accesstype All Open Access; Gold Open Access
record_format scopus
collection Scopus
_version_ 1798286504512978944