Vol. 8 No. 2 (2024): Vol 8, Iss 2, Year 2024
Articles
Published
December 7, 2024
Keywords
- Magic squares, complete graphs, Super magic graphs, complete bipartite graphs
How to Cite
Geethalakshmi S, Saraswathi D, & Divya Bharathi S. (2024). Super Magic Labelling of Complete Bipartite Graphs. Journal of Computational Mathematica, 8(2), 69 - 73. https://doi.org/10.26524/cm196
Abstract
The study of graph labelling has focused on finding classes of graphs which admits a particular type of labelling. A graph is called super magic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. Some constructions of super magic labelling of regular graphs are described. Super magic regular complete bipartite graphs are characterized.
Downloads
Download data is not yet available.