A totally magic cordial labeling of one-point union of n copies of a graph

DOI10.7494/OPMATH.2014.34.1.115zbMath1287.05135OpenAlexW2099984058MaRDI QIDQ5414114

P. Jeyanthi, N. Angel Benseera

Publication date: 2 May 2014

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/opmath.2014.34.1.115

zbMATH Keywords

one-point union of graphstotally magic cordial labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

On k-totally magic cordial labeling of graphs ⋮ Total magic cordial labeling of complete multipartite graphs ⋮ Hypo-k-Totally Magic Cordial Labeling of Graphs

This page was built for publication: A totally magic cordial labeling of one-point union of n copies of a graph