Induced magic labeling of some graphs
Downloads
DOI:
https://doi.org/10.26637/MJM0801/0011Abstract
Let $G=(V, E)$ be a graph and let $(A,+)$ be an Abelian group with identity elemento. Let $f: V \rightarrow A$ be a vertex labeling and $f^*: E \rightarrow A$ be the induced labeling of $f$, defined by $f^*\left(v_1 v_2\right)=f\left(v_1\right)+f\left(v_2\right)$ for all $v_1 v_2 \in E$. Then $f^*$ again induces a labeling say $f^{* *}: V \rightarrow A$ defined by $f^{* *}(v)=\sum_{v v_1 \in E} f^*\left(v v_1\right)$. A graph $G=(V, E)$ is said to be an Induced $A$-Magic Graph (IAMG) if there exists a non zero labeling $f: V \rightarrow A$ such that $f \equiv f^{* *}$. The function $f$, so obtained is called an Induced $A$-Magic Labeling (IAML) of $G$ and a graph which has no such Induced Magic Labeling is called a Non-induced magic graph. In this paper we discuss the existence of Induced Magic Labeling of some special graphs like $P_n, C_n, K_n$ and $K_{m, n}$.
Keywords:
Induced A-Magic Labeling of Graphs, Induced A-Magic graphs.Mathematics Subject Classification:
Mathematics- Pages: 59-61
- Date Published: 01-01-2020
- Vol. 8 No. 01 (2020): Malaya Journal of Matematik (MJM)
R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory, Springer, 2012.
F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1972.
Chartrand G, Zhang P, Introduction to Graph Theory, McGraw-Hill, Boston; 2005.
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 MJM
This work is licensed under a Creative Commons Attribution 4.0 International License.