Processing math: 0%
Edge-Magic Labelings of Wheel Graphs
FUKUCHI, Yasuhiro
Tokyo J. of Math., Tome 24 (2001) no. 2, p. 153-167 / Harvested from Project Euclid
A graph G is called edge-magic if there exists a bijection f from V(G)\cup E(G) to \{1,2,\ldots,|V(G)|+|E(G)|\} such that f(x)+f(y)+f(xy)=C is a constant for any xy\in E(G). In this paper, we show that a wheel graph W_n is edge-magic if n\not\equiv 0 \pmod{4}.
Publié le : 2001-06-15
Classification: 
@article{1255958319,
     author = {FUKUCHI, Yasuhiro},
     title = {Edge-Magic Labelings of Wheel Graphs},
     journal = {Tokyo J. of Math.},
     volume = {24},
     number = {2},
     year = {2001},
     pages = { 153-167},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1255958319}
}
FUKUCHI, Yasuhiro. Edge-Magic Labelings of Wheel Graphs. Tokyo J. of Math., Tome 24 (2001) no. 2, pp.  153-167. http://gdmltest.u-ga.fr/item/1255958319/