Pronic Heron Mean labeling on special cases of generalized Peterson graph P(n;k) and disconnected graphs
Downloads
Abstract
A graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions. In
this paper for a graph G(V;E) each of the vertices v 2 V(G) are assigned by pronic numbers. In this paper, we
investigate the pronic heron mean labeling on special cases of generalized Petersen graph P(n;k). Also we
described an algorithm to label the vertices for the pronic heron mean labeling for certain disconnected graphs.
Keywords:
Pronic Heron Mean labeling, Generalized Peterson Graph P(n;k), Disconnected GraphsMathematics Subject Classification:
Mathematics- Pages: 262-266
- Date Published: 01-01-2021
- Vol. 9 No. 01 (2021): Malaya Journal of Matematik (MJM)
[I] Harary. F, Graph Theory, Narosa Publishing House, New Delhi, 1988.
Joseph A. Gallion, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics, Vol. no. 19, 2012.
Sambath Kumar. R, Narasimhan. G, Nagaraja. K. M, Heron Mean Labeling of Graphs, Intemational Journal of Recent Scientific Research, 8(2017), 19808-19811.
Sophia Porchelvi. R, Akila Devi. S, Pronic Heron Mean Graphs, The Intemational Journal of Analytical and Experimental Modal Analysis, Volume XII, Issue III, $operatorname{March} / 2020,2207-2212$.
Similar Articles
- V. Karthikeyan, $\Gamma$-Synchronization of single valued neutrosophic automata , Malaya Journal of Matematik: Vol. 9 No. 01 (2021): Malaya Journal of Matematik (MJM)
You may also start an advanced similarity search for this article.
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2021 MJM
This work is licensed under a Creative Commons Attribution 4.0 International License.
