Please use this identifier to cite or link to this item: https://idr.l3.nitk.ac.in/jspui/handle/123456789/12364
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHegde, S.M.-
dc.contributor.authorShetty, S.-
dc.date.accessioned2020-03-31T08:39:05Z-
dc.date.available2020-03-31T08:39:05Z-
dc.date.issued2003-
dc.identifier.citationAustralasian Journal of Combinatorics, 2003, Vol.27, , pp.277-284en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/12364-
dc.description.abstractA (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.en_US
dc.titleOn magic graphsen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
File Description SizeFormat 
3 On magic graphs.pdf159.95 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.