نتایج جستجو برای: h e super magic labeling
تعداد نتایج: 1570723 فیلتر نتایج به سال:
Let G(V, E) be a graph with p vertices and q edges. For every assignment f : V (G) → {0, 1, 2, . . . , q}, consider an induced edge labeling f ∗ : E(G) → {1, 2, . . . , q} defined by f ∗(uv) = { f(u)+f(v) 2 if f(u) and f(v) are of the same parity, f(u)+f(v)+1 2 otherwise for every edge uv ∈ E(G). If f ∗(E) = {1, 2, . . . , q}, then we say that f is a mean labeling of G. If a graph G admits a me...
Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...
This paper deals with two types of graph labelings namely, the super (a, d)-edge antimagic total labeling and super (a, d)-vertex antimagic total labeling on the Harary graph C n. We also construct the super edge-antimagic and super vertex-antimagic total labelings for a disjoint union of k identical copies of the Harary graph.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید