A (p, q)-graph G = (V,E) is said to be magic if there exists a bijection f: V ? E ? {1, 2, 3,..., p + q} such that for all edges uv of G, f(u) + f(v) + f(uv) is a constant. The minimum of all constants say, m(G), where the minimum is taken over all such bijections of a magic graph G, is called the magic strength of G. In this paper we define the maximum of all constants say, M(G), analogous to m(G), and introduce strong magic, ideal magic, weak magic labelings, and prove that some known classes of graphs admit such labelings.
| dc.contributor.author | Hegde, S.M. | |
| dc.contributor.author | Shetty, S. | |
| dc.date.accessioned | 2026-02-05T11:00:21Z | |
| dc.date.issued | On magic graphs | |
| dc.description.abstract | 2003 | |
| dc.identifier.citation | Australasian Journal of Combinatorics, 2003, 27, , pp. 277-284 | |
| dc.identifier.issn | 10344942 | |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/27966 | |
| dc.title | A (p, q)-graph G = (V,E) is said to be magic if there exists a bijection f: V ? E ? {1, 2, 3,..., p + q} such that for all edges uv of G, f(u) + f(v) + f(uv) is a constant. The minimum of all constants say, m(G), where the minimum is taken over all such bijections of a magic graph G, is called the magic strength of G. In this paper we define the maximum of all constants say, M(G), analogous to m(G), and introduce strong magic, ideal magic, weak magic labelings, and prove that some known classes of graphs admit such labelings. |