Results 81 to 90 of about 412,708 (144)
Totally antimagic total graphs.
Australas. J Comb., 2015 For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, ., |V(G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the edge and the labels of the end vertices of that edge.
Bača, Martin +5 more
openaire +2 more sources
, 2011 We call a graph antimagic if we can distribute the numbers 1,2, ...,n among its n Pearls in graph theory, Nora Hartsfield and Gerhard Ringel conjectured that every graph except for K2 has an antimagic edge labeling. Let's call a graph weakly antimagic if
Micheal Jackanich
core
, 2013 For an arbitrary set of distances $D\subseteq \{0,1, \ldots, diam(G)\}$, a $D$-weight of a vertex $x$ in a graph $G$ under a vertex labeling $f:V\rightarrow \{1,2, \ldots , v\}$ is defined as $w_D(x)=\sum_{y\in N_D(x)} f(y)$, where $N_D(x) = \{y \in V| d(x,y) \in D\}$. A graph $G$ is said to be $D$-distance magic if all vertices has the same $D$-vertex-
Simanjuntak, Rinovia, Wijaya, Kristiana
openaire +2 more sources
On distance antimagic labeling of graphs [PDF]
, 2016 Досліджується антимагічний тип вершинної розмітки графа. Для циркулянтних графів знайдена необхідна умова, а для голландського вітряка – необхідна і достатня умови існування (a, d)-дистанційної антимагічної розмітки.Исследуется антимагический тип ...
Семенюта, М.Ф.
core +2 more sources
Weighted-1-antimagic graphs of prime power order [PDF]
, 2012 Suppose G is a graph, k is a non-negative integer. We say G is weighted-k-antimagic if for any vertex weight function w:V→N, there is an injection f:E→{1,2,…,∣E∣+k} such that for any two distinct vertices u and v, ∑e∈E(v)f(e)+w(v)≠∑e∈E(u)f(e)+w(u). There
Huang, Po-Yi +5 more
core +1 more source
Sparse graphs with vertex antimagic edge labelings
, 2013 Hartsfeld and Ringel in 1990 introduced the concept of an antimagic labeling of a graph, that is, a vertex antimagic edge labeling and they also conjectured that every connected graph, except K2, is antimagic.
Miller, Mirka +3 more
core
Connected (3,2)-bipartite graphs are antimagic [PDF]
An antimagic labelling of a graph is a bijection from the set of edges to $\{1, 2, \ldots , m\}$, such that all vertex-sums are pairwise distinct, where the vertex-sum of a vertex is the sum of labels on the edges incident to it.
Beaudoire, Grégoire +2 more
core +1 more source
D-antimagic labelings arising from completely separating systems
Electronic Journal of Graph Theory and ApplicationsLet D be a non-empty subset of the distance set {0,1,…, diam(G)}. A graph G is D-antimagic if there exists a bijection f:V(G)→{1,2,…,|V(G)|} such that for every pair of distinct vertices x and y, wD(x) ≠ wD(y), where wD(x) = Σz∈ND(x)f(z) is the D-weight ...
Risma Yulina Wulandari +2 more
doaj +1 more source
Local edge antimagic chromatic number of join product of graphs
Indonesian Journal of CombinatoricsLet f : V(G) \to [1,|V(G)|] be a bijective mapping of the vertex set of a graph G to the integers 1 through |V(G)|. A labeling f is defined as a local edge antimagic labeling if, for any two adjacent edges uv and vx in E(G), their weights satisfy wf(uv) ≠
Tita Khalis Maryati +1 more
doaj +1 more source
On the relations among edge magic total, edge antimagic total, and ASD-antimagic graphs
Electronic Journal of Graph Theory and ApplicationsLet G be a simple and finite graph of order p and size q. The graph G is said to be edge magic total (EMT) if there is a bijection λ:V(G)∪E(G)→{1,2,…,p+q} such that all edge sums λ(x)+λ(xy)+λ(y), xy∈E(G), are the same.
Sigit Pancahayani +4 more
doaj +1 more source