×

zbMATH — the first resource for mathematics

On edge-magic \((p,3p-1)\)-graphs. (English) Zbl 1117.05095
A \((p,q)\)-graph \(G\) in which the edges are labeled \(1,2,\dots,q\) so that the vertex sums are constant, is called supermagic. If the vertex sum modulo \(p\) is a constant, then \(G\) is called edge-magic. Lee, Seah and Tan introduced the concept of edge-magic graphs, which is a weaker concept than supermagic graphs. Using edge-splitting extension on stars, trees, cycles and \((p,p+1)\)-graphs, the authors find several infinite families of edge-magic graphs.

MSC:
05C78 Graph labelling (graceful graphs, bandwidth, etc.)
PDF BibTeX XML Cite