نتایج جستجو برای: H-E-super magic labeling
تعداد نتایج: 1570723 فیلتر نتایج به سال:
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 ≥ ...
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 ≥ ...
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 ≥...
An H-magic labeling in an 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∈V (H) f(v)+ ∑ e∈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 labeling and we provide a necessary and sufficient cond...
A graph G admits an H-covering if every edge of belongs to a subgraph isomorphic given H. is said be H-magic there exists bijection f:V(G)∪E(G)→{1,2,…,|V(G)|+|E(G)|} such that wf(H′)=∑v∈V(H′)f(v)+∑e∈E(H′)f(e) constant, for H′ In particular, H-supermagic f(V(G))={1,2,…,|V(G)|}. When H complete K2, H-(super)magic labeling edge-(super)magic labeling. Suppose F-covering and two graphs F We define (...
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 ...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. The graph G is H−magic if there exists a bijection f : V (G) [ E(G) ! {1, 2, 3, · · · , |V (G) [ E(G)|} such that for every subgraph H0 P of G isomorphic to H. G is said to be H − supermagic if f(V (G)) = {1, 2, 3, · · · , |V (G)|}. In thi...
Abstract : In this paper we introduced the concept of complementary super edge magic labeling and Complementary Super Edge Magic strength of a graph G.A graph G (V, E ) is said to be complementary super edge magic if there exist a bijection f:V U E → { 1, 2, ............p+q } such that p+q+1 f(x) is constant. Such a labeling is called complementary super edge magic labeling with complementary s...
Let $A$ be an abelian group. A graph $G=(V,E)$ is said to be $A$-barycentric-magic if there exists a labeling $l:E(G)longrightarrow Asetminuslbrace{0}rbrace$ such that the induced vertex set labeling $l^{+}:V(G)longrightarrow A$ defined by $l^{+}(v)=sum_{uvin E(G)}l(uv)$ is a constant map and also satisfies that $l^{+}(v)=deg(v)l(u_{v}v)$ for all $v in V$, and for some vertex $u_{v}$ adjacent t...
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f from G E G V to the consecutive integers 1, 2, ..., p+q with the property that for every G V u , k uv f u f u N v for some constant k. Such a labeling is E-super if q G E f , , 2 , 1 : . A graph G is called E-super vertex magic if it admits an E-supe...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید