Most wheel related graphs are not vertex magic

Authors

  • Rahim M.T.
  • Slamin

Abstract

Suppose G is a finite graph with vertex-set V(G) and edge-set E(G). A one-to-one map λ from V(G) ∪ E(G) onto the integers 1,2,3,..., |V(G)| + |E(G)| is called a vertex-magic total labeling, if there exists a constant h so that for every vertex x, λ(x) + Σλ(xy) = h where the sum is taken over all vertices y adjacent to x. The constant h is called the magic constant for λ. A graph with a vertex-magic total labeling will be called vertex-magic. In this paper, we consider the vertex-magic total labeling of wheel related graphs such as Jahangir graphs, helms, webs, flower graphs and sunflower graphs.

Published

2008-09-09

How to Cite

Rahim M.T., & Slamin. (2008). Most wheel related graphs are not vertex magic. Utilitas Mathematica, 77. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/522

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.