Publication Type : Book Chapter
Publisher : Springer
Source : In: Awasthi A., John S.J., Panda S. (eds) Com- putational Sciences - Modelling, Computing and Soft Computing. CSMCS 2020. Communications in Computer and Information Science, vol 1345. Springer, Singa- pore
Url : https://link.springer.com/chapter/10.1007/978-981-16-4772-7_19
Campus : Amritapuri
School : School of Arts and Sciences
Department : Mathematics
Year : 2020
Abstract : Let G be an undirected simple graph with vertex set V(G) and the edge set E(G) and A be an additive Abelian group with the identity element 0. A function l:V(G)→A∖{0} is said to be a A-vertex magic labeling of G if there exists an element μ of A such that w(v)=∑u∈N(v)l(u)=μ for any vertex v of G. A graph G having A-vertex magic labeling is called a A-vertex magic graph. If G is A-vertex magic graph for every non-trivial additive Abelian group A, then G is called a group vertex magic graph. In this article, a characterization for the A-vertex magicness of any tree T with diameter 5, is given, when A≅Z2⊕Z2.
Cite this Research Publication : Kollaran M S, A V Prajeesh, K Paramasivam, A Characterization for V4-Vertex Mag- icness of Trees with Diameter 5. In: Awasthi A., John S.J., Panda S. (eds) Com- putational Sciences - Modelling, Computing and Soft Computing. CSMCS 2020. Communications in Computer and Information Science, vol 1345. Springer, Singa- pore. https://doi.org/10.1007/978-981-16-4772-7 19