Edge-Magic Total Labelings

W. D. Wallis
Additional contact information
W. D. Wallis: Southern Illinois University, Department of Mathematics

Chapter 2 in Magic Graphs, 2001, pp 17-64 from Springer

Abstract: Abstract An edge-magic total labeling on a graph G is a one-to-one map λ from V(G) ∪ E(G) onto the integers 1, 2, …, v + e, where v =V(G)\ and e = E(G), with the property that, given any edge (xy), k(x) + k(xy) + k(y) = k for some constant k. In other words, wt (xy) = K for any choice of edge xy. k is called the magic sum of G. Any graph with an edge-magic total labeling will be called edge-magic.

Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-0123-6_2

Ordering information: This item can be ordered from
http://www.springer.com/9781461201236

DOI: 10.1007/978-1-4612-0123-6_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().