On even vertex odd mean labeling of the calendula graphs
DOI:
https://doi.org/10.22199/issn.0717-6279-2020-06-0091Keywords:
Labeling, Even vertex odd mean labeling, Calendula graphAbstract
A graph G with |E(G)|=q, an injective function f : V (G) → {0, 2, 4, ..., 2q} is an even vertex odd mean labeling of G that induces the values {f(u)+f(v)}/{2} for the q pairs of adjacent vertices u,v are distinct. In this paper, we investigate an even vertex labeling for the calendula graphs. Moreover we introduce the definition of arbitrary calendula graph and prove that the arbitrary calendula graphs are also even vertex odd mean graphs.
References
J. A. Gallian, “Graph labeling”, The electronic journal of combinatorics, no. DS6, Nov. 2010, doi: 10.37236/27
F. Harary, Graph theory, Reading, MA: Addison-Wesley, 1972.
M. Basher, “Further results on even vertex odd mean graphs”, Journal of discrete mathematical sciences and cryptography, Nov. 2019, doi: 10.1080/09720529.2019.1675301
P. Jeyanthi, D. Ramya, and M. Selvi, “Even vertex odd mean labeling of transformed trees”, TWMS journal appied engineering mathematics, vol. 10, no. 2, pp. 338-345, 2020. [On line]. Available: https://bit.ly/3kL2KiN
A. Rosa, “On certain valuations of the vertices of a graph”, in International Symposium on Graph Theory and its Applications, held in Rome, July 1966 under the auspices of the International Computation Center (Rome) , P. Rosenstiehl, Ed. London: Gordon & Breach, 1967, pp. 349–355. [On line]. Available: https://bit.ly/320qqst
T R Pradipta and A N M Salman, “Some cycle-supermagic labelings of the calendula graphs”, Journal of physics: conference series, Vol. 948, Art ID. 012071, 2018, doi: 10.1088/1742-6596/948/1/012071
R. Vasuki, A. Nagarajan and S. Arockiaraj, “Even vertex odd mean labeling of graphs”, SUT journal of mathematics, vol. 49, no. 2, pp. 79-92, 2013.
Published
How to Cite
Issue
Section
Copyright (c) 2020 mohamed basher basher
This work is licensed under a Creative Commons Attribution 4.0 International License.
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
