Sciweavers

DM
2010

On k-minimum and m-minimum edge-magic injections of graphs

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 of . An edgemagic injection (EMI)
John P. McSorley, John A. Trono
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2010
Where DM
Authors John P. McSorley, John A. Trono
Comments (0)