Totally Magic Labelings

Alison M. Marr and W. D. Wallis
Additional contact information
Alison M. Marr: Southwestern University, Department of Mathematics and Computer Science
W. D. Wallis: Southern Illinois University, Department of Mathematics

Chapter 4 in Magic Graphs, 2013, pp 111-134 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: Edge Incident; Common Neighbor; Edge Label; Vertex Label; Vertex Weight (search for similar items in EconPapers)
Date: 2013
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-0-8176-8391-7_4

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

DOI: 10.1007/978-0-8176-8391-7_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 ().