Hypo-k-Totally Magic Cordial Labeling of Graphs
Author
Jeyanthi, P.
Benseera, N. Angel
Lau, Gee Gee
Abstract
A graph G is said to be hypo-k-totally magic cordial if G — {v} is k-totally magic cordial for each vertex v in V(G). In this paper, we establish that cycle, complete graph, complete bipartite graph and wheel graph admit hypo-k-totally magic cordial labeling and some families of graphs do not admit hypo-k-totally magic cordial labeling.
Metadata
Show full item recordRelated items
Showing items related by title, author, creator and subject.
-
Graceful centers of graceful graphs and universal graceful graphs.
Makadia, H. M.; Karavadiya, H. M.; Kaneria, V. J.. Proyecciones. Journal of Mathematics; Vol 38 No 2 (2019); 305-314 -
Equitable Graph of a Graph
Dharmalingam, Kuppusamy Makandan. Proyecciones. Journal of Mathematics; Vol 31 No 4 (2012); 363-372 -
Irregularity indices for line graph of Dutch windmill graph
Mohammed, Mohanad A.; AL-Mayyahi, Suad Younus A. AL-Mayyahi; Virk, Abaid ur Rehman; Rehman, Hafiz Mutee ur. Proyecciones (Antofagasta, On line); Vol. 39 No. 4 (2020): Special Issue: Mathematical Computation in Combinatorics and Graph Theory; 903-918