Results 51 to 60 of about 935 (138)
Perfect (super) Edge-Magic Crowns [PDF]
, 2017 A graph G is called edge-magic if there is a bijective function f from the set of vertices and edges to the set {1,2,…,|V(G)|+|E(G)|} such that the sum f(x)+f(xy)+f(y) for any xy in E(G) is constant. Such a function is called an edge-magic labelling of G
López Masip, Susana Clara +2 more
core +4 more sources
On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture [PDF]
, 2017 International audienceThis paper is dedicated to studying the following question: Is it always possible to injectively assign the weights 1, ..., |E(G)| to the edges of any given graph G (with no component isomorphic to K2) so that every two adjacent ...
Bensmail, Julien +2 more
core +5 more sources
Super (a,d)-P_2⨀P_m-Antimagic Total Labeling of Corona Product of Two Paths
JTAM (Jurnal Teori dan Aplikasi Matematika)Graph labeling involves mapping the elements of a graph (edges and vertices) to a set of positive integers. The concept of an anti-magic super outer labeling (a,d)-H pertains to assigning labels to the vertices and edges of a graph using natural numbers {
Bela Zainun Yatin +2 more
doaj +1 more source
Integer-antimagic spectra of disjoint unions of cycles
Theory and Applications of Graphs, 2018 Let $A$ be a non-trivial abelian group. A simple graph $G = (V, E)$ is $A$-antimagic if there exists an edge labeling $f: E(G) \to A \setminus \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \sum_{uv\in E(G)}f(uv ...
Wai Chee Shiu
doaj +1 more source
Local Antimagic Chromatic Number for Copies of Graphs
Mathematics, 2021 An edge labeling of a graph G=(V,E) using every label from the set {1,2,⋯,|E(G)|} exactly once is a local antimagic labeling if the vertex-weights are distinct for every pair of neighboring vertices, where a vertex-weight is the sum of labels of all ...
Martin Bača +2 more
doaj +1 more source
Tree‐Antimagicness of Disconnected Graphs
Mathematical Problems in Engineering, Volume 2015, Issue 1, 2015., 2015 A simple graph G admits an H‐covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. The graph G is said to be (a, d)‐H‐antimagic if there exists a bijection from the vertex set V(G) and the edge set E(G) onto the set of integers {1, 2, … , |V(G)| + |E(G)|} such that, for all subgraphs H′ of G isomorphic to H, the sum of labels of ...
Martin Bača +4 more
wiley +1 more source
New Results of Face Labeling for Some Plane Graphs
IEEE Access, 2019 A labeling of a plane graph is called super d-antimagic if the vertices receive the smallest labels and the weight set of all faces in an arithematic progression with difference d, where weight of each face is the some of all labels correspond to that ...
Nabila Hameed +4 more
doaj +1 more source
On Super (a, d)‐Edge‐Antimagic Total Labeling of Special Types of Crown Graphs
Journal of Applied Mathematics, Volume 2013, Issue 1, 2013., 2013 For a graph G = (V, E), a bijection f from V(G) ∪ E(G) → {1, 2, …, |V(G)| + |E(G)|} is called (a, d)‐edge‐antimagic total ((a, d)‐EAT) labeling of G if the edge‐weights w(xy) = f(x) + f(y) + f(xy), xy ∈ E(G), form an arithmetic progression starting from a and having a common difference d, where a > 0 and d ≥ 0 are two fixed integers.
Himayat Ullah +4 more
wiley +1 more source
On cordial labeling of hypertrees
, 2019 Let $f:V\rightarrow\mathbb{Z}_k$ be a vertex labeling of a hypergraph $H=(V,E)$. This labeling induces an~edge labeling of $H$ defined by $f(e)=\sum_{v\in e}f(v)$, where the sum is taken modulo $k$.
Tuczyński, Michał +2 more
core +1 more source
Group-antimagic Labelings of Multi-cyclic Graphs
Theory and Applications of Graphs, 2016 Let $A$ be a non-trivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimagic} if there exists an edge labeling $f: E(G) \to A \backslash \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \Sigma$
Dan Roberts, Richard Low
doaj +1 more source