نتایج جستجو برای: h e super magic labeling

تعداد نتایج: 1570723  

Journal: :Australasian J. Combinatorics 2008
Wai Chee Shiu Richard M. Low

In this paper, a generalization of a group-magic graph is introduced and studied. Let R be a commutative ring with unity 1. A graph G = (V,E) is called R-ring-magic if there exists a labeling f : E → R−{0} such that the induced vertex labelings f : V → R, defined by f(v) = Σf(u, v) where (u, v) ∈ E, and f : V → R, defined by f(v) = Πf(u, v) where (u, v) ∈ E, are constant maps. General algebraic...

2005
Tao-Ming Wang

An anti-magic labeling of a finite simple undirected graph with p vertices and q edges is a bijection from the set of edges to the integers {1, ..., q} such that all p vertex sums are pairwise distinct, where the vertex sum on a vertex is the sum of labels of all edges incident to such vertex. A graph is called anti-magic if it has an anti-magic labeling. Hartsfield and Ringel [3] conjectured t...

2004
W. C. Shiu P. K. Sun

Let A be an abelian group. An A-magic of a graph G = (V, E) is a labeling l : E(G) → A \ {0} such that the sum of the labels of the edges incident with u ∈ V is a constant, where 0 is the identity element of the group A. In this paper, we will show that some classes of graphs are A-magic for all abelian group A of even order other than 2. Also, we prove that product and composition of A-magic g...

Journal: :AKCE International Journal of Graphs and Combinatorics 2016

2016
R. Senthil Amutha N. Murugesan

A vertex magic total labeling on a graph with v vertices and e edges is a one to one map taking the vertices and edges onto the integers with the property that the sum of the label on the vertex and the labels of its incident edges is a constant, independent of the choice of the vertex. A graph with vertex magic total labeling with two constants or is called a vertex bimagic total labeling. The...

2013
P. Jeyanthi N. Angel Benseera

A graph G is said to have totally magic cordial(TMC) 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 investigate some new families of graphs that admit totally magic cordial labeli...

Journal: :Discrete Applied Mathematics 2014

Journal: :Mathematics in Computer Science 2011
Susana-Clara López Francesc A. Muntaner-Batle Miquel Rius-Font

In this paper, we generalize the concept of super edge-magic graph by introducing the new concept of super edge-magic models.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید