منابع مشابه
Totally magic cordial labeling of some graphs
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کامل$Z_k$-Magic Labeling of Some Families of Graphs
For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$ the group of integers modulo $k...
متن کاملtotally magic cordial labeling of some graphs
a graph g is said to have a totally magic cordial labeling with constant c if there exists a mapping f : v (g) ∪ e(g) → {0, 1} such that f(a) + f(b) + f(ab) ≡ c (mod 2) for all ab ∈ e(g) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. in this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملEdge-Magic Labeling of some Graphs
An edge magic labeling f of a graph with p vertices and q edges is a bijection f: V ∪ E → {1, 2, ..., p + q } such that there exists a constant s for any (x, y) in E satisfying f(x) + f(x, v) + f(y)= s. In this paper, the edge-magic labelings of ncm and some other graphs are discussed.
متن کاملGroup distance magic labeling of some cycle-related graphs
Let G = (V,E) be a graph and Γ an abelian group, both of order n. A group distance magic labeling of G is a bijection : V → Γ for which there exists μ ∈ Γ such that ∑x∈N(v) (x) = μ for all v ∈ V, where N(v) is the neighborhood of v. Froncek [Australas. J. Combin. 55 (2013), 167–174] showed that the cartesian product Cm Cn, m,n ≥ 3 is a Zmn-distance magic graph if and only if mn is even. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2020
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0801/0011