article · Proyecciones (Antofagasta) · 2023
Analytic odd mean labeling of union and identification of some graphs
P. Jeyanthi, R. Gomathi, Gee-Choon Lau, Wai Chee Shiu
Cited by 0Open access
Abstract
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), 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.
Cite this paper
Jeyanthi, P., Gomathi, R., Lau, G.-C., & Shiu, W. C. (2023). Analytic odd mean labeling of union and identification of some graphs. Proyecciones (Antofagasta), 42(5), 1141–1155. https://doi.org/10.22199/issn.0717-6279-3505
Jeyanthi, P., et al. “Analytic odd mean labeling of union and identification of some graphs.” Proyecciones (Antofagasta), vol. 42, no. 5, 2023, pp. 1141–55, https://doi.org/10.22199/issn.0717-6279-3505.
Jeyanthi, P., R. Gomathi, Gee-Choon Lau, and Wai Chee Shiu. 2023. “Analytic odd mean labeling of union and identification of some graphs.” Proyecciones (Antofagasta) 42 (5): 1141–55. https://doi.org/10.22199/issn.0717-6279-3505.
Jeyanthi, P. et al. (2023) ‘Analytic odd mean labeling of union and identification of some graphs’, Proyecciones (Antofagasta), 42(5), pp. 1141–1155. Available at: https://doi.org/10.22199/issn.0717-6279-3505.
@article{jeyanthi2023analytic,
title = {{Analytic odd mean labeling of union and identification of some graphs}},
author = {Jeyanthi, P. and Gomathi, R. and Lau, Gee-Choon and Shiu, Wai Chee},
journal = {Proyecciones (Antofagasta)},
volume = {42},
number = {5},
pages = {1141--1155},
year = {2023},
doi = {10.22199/issn.0717-6279-3505}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
On Integer Additive Set-Indexers of Graphs
Sudev, N. K., Germina, K. A. · arXiv (Cornell University) · 2013
Cited by 34Open access
A Note on Integer Additive Set-Indexers of Graphs
Sudev Naduvath, K. A. Germina · arXiv (Cornell University) · 2013
Cited by 2Open access
Weak Integer Additive Set-Indexers of Certain Graph Products
Sudev Naduvath, K. A. Germina · Journal of Informatics and Mathematical Sciences · 2014
Cited by 3Open access
On Arithmetic Integer Additive Set-Indexers of Graphs
Sudev Naduvath, K. A. Germina · arXiv (Cornell University) · 2013
Cited by 2Open access
A Study on the Nourishing Number of Graphs and Graph Powers
Sudev Naduvath, K. A. Germina · Mathematics · 2015
Cited by 8Open access
A Study on Arithmetic Integer Additive Set-Indexers of Graphs
Sudev Naduvath · Journal of Informatics and Mathematical Sciences · 2018
Cited by 5Open access
A study on integer additive set-valuations of signed graphs
Sudev Naduvath, K. A. Germina · Carpathian Mathematical Publications · 2015
Cited by 8Open access