BOOK-CHAPTER

Vertex-Magic Total Labelings

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:
MAGIC (telescope) Vertex (graph theory) Combinatorics Graph Mathematics Physics Quantum mechanics

Metrics

1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
0
Refs
0.44
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Graph Labeling and Dimension Problems
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

BOOK-CHAPTER

Vertex-Magic Total Labelings

Alison MarrW. D. Wallis

Year: 2012 Pages: 71-109
BOOK-CHAPTER

Vertex-Magic Total Labelings

Martin BačaMirka MillerJoe RyanAndrea Semaničová–Feňovčíková

Developments in mathematics Year: 2019 Pages: 89-116
JOURNAL ARTICLE

Vertex‐Magic Total Labelings of Regular Graphs

I. D. Gray

Journal:   SIAM Journal on Discrete Mathematics Year: 2007 Vol: 21 (1)Pages: 170-177
JOURNAL ARTICLE

Vertex-Magic Total Labelings Of Generalized Petersen Graphs

Martin BacˇAMirka MillerSlamin Slamin

Journal:   International Journal of Computer Mathematics Year: 2002 Vol: 79 (12)Pages: 1259-1263
JOURNAL ARTICLE

Vertex magic total labelings of 2-regular graphs

Sylwia CichaczDalibor FrončekInne Singgih

Journal:   Discrete Mathematics Year: 2016 Vol: 340 (1)Pages: 3117-3124
© 2026 ScienceGate Book Chapters — All rights reserved.