INTEGER-MAGIC SPECTRA OF CYCLE RELATED GRAPHS
author
Abstract:
For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the integer-magic spectra of certain classes of cycle related graphs will be determined.
similar resources
Integer-magic Spectra of Cycle Related Graphs
A graph G is said to be A-magic if there is a labeling l : E(G) −→ A − {0} such that for each vertex v, the sum of the labels of the edges incident with v are all equal to the same constant; that is, l+(v) = c for some fixed c ∈ A. In general, a graph G may admit more than one labeling to become A-magic; for example, if |A| > 2 and l : E(G) −→ A − {0} is a magic labeling of G with sum c, then l...
full textInteger-Magic Spectra of Functional Extension of Graphs
For any k ∈ N, a graph G = (V, E) is said to be Zk-magic if there exists a labeling l : E(G) → Zk − {0} such that the induced vertex set labeling l : V (G) → Zk defined by l(v) = ∑ uv∈E(G) l(uv) is a constant map. For a given graph G, the set of all k ∈ N for which G is Zk-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper we will consider the functional exte...
full textInteger-Magic Spectra of Functional Extensions of Graphs
For any kEN, a graph G = (V, E) is said to be ;:z k-magic if there exists a labeling Z: E( G) --+ ;:z k {OJ such that the induced vertex set labeling Z+: V (G) --+ ;:z k defined by Z+(v) = L Z(uv) uvEE(G) is a constant map. For a given graph G, the set of all kEN for which G is ;:z k-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper we will consider the func...
full textOn the Integer-Magic Spectra of Honeycomb Graphs
For a positive integer k, a graph G (V, E) is £k-magic if there exists a function, namely, a labeling, I : E(G) -+ £k such that the induced vertex set labeling [+ : V(G) £k, where [+(v) is the sum of the labels of the edges incident with a vertex v is a constant map. The set of all positive integer k such that G is k-magic is denoted by IM(G). We call this set the integer-magic spectrum of G. I...
full textMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
full textMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...
full textMy Resources
Journal title
volume 1 issue None
pages 53- 63
publication date 2006-11
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023