Some C3-supermagic graphs

Authors

  • Jeyanthi P.
  • Selvagopal P.
  • Sundaram, S. Soma

Abstract

A simple graph G = (V, E) admits an H-covering if every edge in E belongs to a subgraph of G isomorphic to H. We say that G is Hmagic if there is a total labeling f : V ∪ E → {1,2,3, ⋯ , |V| + E} such that for each subgraph H' = (V', E') of G isomorphic to H, the sum Σ f(v) + Σ f(e) is constant. When f(V) = {1,2, ⋯ , |V|}, then G is vεV' eεE' said to be H-supermagic. In this paper we study C 3-supermagic behaviour of some well known classes of connected graphs.

Published

2012-09-09

How to Cite

Jeyanthi P., Selvagopal P., & Sundaram, S. Soma. (2012). Some C3-supermagic graphs. Utilitas Mathematica, 89. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/834

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.