Strong edge-magic graphs of maximum size |
| |
Authors: | J.A. MacDougall |
| |
Affiliation: | a School of Mathematical and Physical Sciences, University of Newcastle, NSW 2308, Australia b Department of Mathematics, Southern Illinois University, Carbondale, IL 62901-4408, USA |
| |
Abstract: | An edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2,…,|V(G)∪E(G)| with the property that, given any edge (x,y), λ(x)+λ(x,y)+λ(y)=k for some constant k. The labeling is strong if all the smallest labels are assigned to the vertices. Enomoto et al. proved that a graph admitting a strong labeling can have at most 2|V(G)|-3 edges. In this paper we study graphs of this maximum size. |
| |
Keywords: | Graph Magic labeling |
本文献已被 ScienceDirect 等数据库收录! |
|