Results 31 to 40 of about 909,592 (58)
, 2022 A graph is a set of {\it{vertices}}, and {\it{edges}} which connect vertices. Given any graph $G$ with $m$ edges, we assign integers from $1$ to $m$ to the edges of $G$ and consider vertex sums, the sums of the edge labels incident at each vertex.
LE, PARKER
core
lnteger-antimagic Labeling of Graphs
, 2022 Let A be a non-trivial abelian group. A connected simple graph G = (V, E) is A-antimagic, ifthere exists an edge labeling : () → \{0} such that the induced vertex labeling +() =Σ{,}∈ () ({, }) is a one-to-one map.
Odabaşı, Uğur
core
[USF] Get Involved with USF Bound, Move-In, and Orientation
, 2020 Campus-wide email from the USF Orientation Team providing information regarding key transition events for incoming students and their family ...
Reid, Annie; Campus-wide +1 more
core
An Inductive Approach to Strongly Antimagic Labelings of Graphs [PDF]
, 2022 An antimagic labeling for a graph $G$ with $m$ edges is a bijection $f: E(G) \to \{1, 2, \dots, m\}$ so that $\phi_f(u) \neq \phi_f(v)$ holds for any pair of distinct vertices $u, v \in V(G)$, where $\phi_f(x) = \sum_{x \in e} f(e)$. A strongly antimagic
Liu, Daphne Der-Fen, Lossada, Vicente
core
, 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
Caterpillars have antimagic orientations
An antimagic labeling of a directed graph D with m arcs is a bijection from the set of arcs of D to {1, . . . , m} such that all oriented vertex sums of vertices in D are pairwise distinct, where the oriented vertex sum of a vertex u is the sum of labels
Lozano Bojados, Antoni
core
Antimagic and product antimagic graphs with pendant edges
Let $G=(V,E)$ be a simple graph of size $m$ and $L$ a set of $m$ distinct real numbers. An $L$-labeling of $G$ is a bijection $\phi: E \rightarrow L$.
Tey, Joaquín, Mora, Mercè
core
Totally antimagic total graphs
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 ...
Anita Abildgaard Sillasen (21325523) +5 more
core
Antimagic labelings of caterpillars
A k-antimagic labeling of a graph G is an injection from E(G) to {1,2, ..., |E(G)|+k} such that all vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of the labels assigned to edges incident to u.
Seara Ojea, Carlos +2 more
core
Local Distance Antimagic Vertex Coloring of Graphs
A bijective function $f:V\rightarrow\left\{1,2,3,...,|V| \right\}$ is said to be a local distance antimagic labeling of a graph $G=(V,E)$, if $w(u)\neq w(v)$ for any two adjacent vertices $u, v$ where the weight $w(v)=\sum_{z\in N(v)}f(z)$.
S, Devi Yamini, T, Divya
core +1 more source