Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7607
Full metadata record
DC FieldValueLanguage
dc.contributor.authorI. D. Gray-
dc.contributor.authorJ. Macdougall-
dc.date.accessioned2024-02-27T06:20:31Z-
dc.date.available2024-02-27T06:20:31Z-
dc.date.issued2003-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7607-
dc.description.abstractSuppose G is a graph with vertex-set V and edge-set E. If λ is a one-to- one map from E∪V onto the integers {1 , 2, ... , e + v }, define the weight of vertex x to be wt(x) = λ (x) +∑ λ (xy), where the sum is over all vertices y adjacent to x. We say λ is a vertex-magic total labeling if there is a constant h so that for every vertex x, wt(x) = h. A graph with such a labeling is a vertex-magic graph.-
dc.publisherBulletin of the Institute of Combinatorics and Its Applications-
dc.titleOn Vertex-Magic Labeling of Complete Graphs-
dc.volVol 38-
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
On Vertex-Magic Labeling of complete Graphs.pdf
  Restricted Access
1.65 MBAdobe PDFView/Open Request a copy


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