H-E-Super magic decomposition of graphs | Zendy

S. Subbiah | Zendy; J. Pandimadevi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

H-E-Super magic decomposition of graphs

Author(s) -

S. Subbiah,

J. Pandimadevi

Publication year - 2014

Publication title -

electronic journal of graph theory and applications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.443

H-Index - 5

ISSN - 2338-2287

DOI - 10.5614/ejgta.2014.2.2.4

Subject(s) - magic (telescope) , magic square , bijection , combinatorics , mathematics , graph , discrete mathematics , physics , quantum mechanics

An H-magic labeling in an H-decomposable graph G is a bijection f:V(G) U E(G) --> {1,2, … ,p+q} such that for every copy H in the decomposition, $\sum\limits_{v\in V(H)} f(v)+\sum\limits_{e\in E(H)} f(e)$ is constant. The function f is said to be H-E-super magic if f(E(G)) = {1,2, … ,q}. In this paper, we study some basic properties of m-factor-E-super magic labelingand we provide a necessary and sufficient condition for an even regular graph to be 2-factor-E-super magic decomposable. For this purpose, we use Petersen's theorem and magic squares.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research