Vertex-Magic Total Labelings

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

Chapter 3 in Magic Graphs, 2001, pp 65-99 from Springer

Abstract: Abstract A one-to-one map X from E ∪ V onto the integers 1, 2, …, e + v is a vertex-magic total labeling if there is a constant h so that for every vertex x, λ(x) + ∑λ(xy) = h(3.1) where the sum is over all vertices y adjacent to x. So the magic requirement is wt(x) — h for all x. The constant h is called the magic constant for λ. Again, a graph with a vertex-magic total labeling will be called vertex-magic

Keywords: Regular Graph; Complete Bipartite Graph; Internal Vertex; Edge Label; Edge Coloring (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_3

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

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

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