Sciweavers

DM
2010
105views more  DM 2010»
13 years 4 months ago
On k-minimum and m-minimum edge-magic injections of graphs
An edge-magic total labelling (EMTL) of a graph G with n vertices and e edges is an injection : V (G)E(G) [n+e], where, for every edge uv E(G), we have wt(uv) = k, the magic sum...
John P. McSorley, John A. Trono