نتایج جستجو برای: z_k magic graph
تعداد نتایج: 208216 فیلتر نتایج به سال:
We compute the equivariant cohomology $H^*_{T_I}(\mathcal Z_K)$ of moment-angle complexes $\mathcal Z_K$ with respect to action coordinate subtori $T_I \subset T^m$. give a criterion for formality and obtain specifications cases flag graphs.
A graph G = (V, E) is said to be magic if there exists an integer labeling f : V ∪ E −→ [1, |V ∪ E|] such that f(x) + f(y) + f(xy) is constant for all edges xy ∈ E. Enomoto, Masuda and Nakamigawa proved that there are magic graphs of order at most 3n + o(n) which contain a complete graph of order n. Bounds on Sidon sets show that the order of such a graph is at least n + o(n). We close the gap ...
Let G = (V,E) be a graph of order n and let D ⊆ {0, 1, 2, 3, . . .}. For v ∈ V, let ND(v) = {u ∈ V : d(u, v) ∈ D}. The graph G is said to be D-vertex magic if there exists a bijection f : V (G) → {1, 2, . . . , n} such that for all v ∈ V, ∑ u∈ND(v) f(u) is a constant, called D-vertex magic constant. O’Neal and Slater have proved the uniqueness of the D-vertex magic constant by showing that it c...
For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l : V (G) → Zh defined by l(v) = ∑ uv∈E(G) l(uv) is a constant map. When this constant is 0 we call G a zero-sum h-magic graph. The null set of G is the set of all natural numbers h ∈ N for which G admits a zero-sum h-magic labeling. A graph G is said to b...
The study of valuations of graphs is a relatively young part of graph theory. In this article we survey what is known about certain graph valuations, that is, labeling methods: antimagic labelings, edge-magic total labelings and vertex-magic total labelings.
Let A be a non-trivial, finitely-generated abelian group and A∗ = A\{0}. A graph is A-magic if there exists an edge labeling using elements of A∗ which induces a constant vertex labeling of the graph. In this paper, we analyze the group-magic property for complete n-partite graphs and composition graphs with deleted edges.
Let G = (V,E) be a graph of order n. A bijection f : V → {1, 2, . . . , n} is called a distance magic labeling of G if there exists a positive integer μ such that ∑ u∈N(v) f(u) = μ for all v ∈ V, where N(v) is the open neighborhood of v. The constant μ is called the magic constant of the labeling f. Any graph which admits a distance magic labeling is called a distance magic graph. The bijection...
A (p; q)-graph G is edge-magic if there exists a bijective function f :V (G)∪E(G)→{1; 2; : : : ; p + q} such that f(u) + f(v) + f(uv)= k is a constant, called the valence of f, for any edge uv of G. Moreover, G is said to be super edge-magic if f(V (G))= {1; 2; : : : ; p}. In this paper, we present some necessary conditions for a graph to be super edge-magic. By means of these, we study the sup...
Let A be an abelian group with non-identity elements A∗. A graph is A-magic if it has an edge-labeling by elements of A∗ which induces a constant vertex labeling of the graph. In this paper we determine, for certain classes of triominoes and polyominoes, for which values of k ≥ 2 the graphs are Zk-magic.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید