Totally Magic Labelings

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

Chapter 4 in Magic Graphs, 2001, pp 101-118 from Springer

Abstract: Abstract In this chapter we investigate the question: for a graph G does there exist a total labeling λ that is both edge-magic and vertex-magic? As we said, such a λ is called a totally magic labeling and G is a totally magic graph. The constants h and k are the magic constant and magic sum respectively. We do not require that h = k.

Keywords: Common Neighbor; Edge Label; Vertex Label; Vertex Weight; Magic Label (search for similar items in EconPapers)
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_4

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

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

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 ().