Results 31 to 40 of about 935 (138)
Antimagic Labeling of Extension of Double Star [PDF]
Pandian Journal of Mathematical Sciences, 2022 An antimagic labeling of a simple, finite connected graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1, 2, …, q} such that the vertex sums are pairwise distinct where the vertex sum at one vertex is the sum ...
Dr C. Meenakshi
doaj
ANTIMAGIC LABELING OF DIGRAPHS [PDF]
Journal of the Indonesian Mathematical Society, 2016 AbstractAn antimagic labeling of a digraph D with p vertices and q arcs is a bin f from the set of all arcs to the set of positive integers such that all the p oriented vertex weights are distinct, where an oriented vertex weight is the sum of the labels of all arcs entering that vertex minus the sum of the labels of all arcs leaving it. A digraph
openaire +2 more sources
Regular graphs of odd degree are antimagic [PDF]
, 2013 An antimagic labeling of a graph $G$ with $m$ edges is a bijection from $E(G)$ to $\{1,2,\ldots,m\}$ such that for all vertices $u$ and $v$, the sum of labels on edges incident to $u$ differs from that for edges incident to $v$.
Cranston, Daniel W.
core +1 more source
Antimagic Labelings of Weighted and Oriented Graphs [PDF]
, 2019 A graph $G$ is $k$-$weighted-list-antimagic$ if for any vertex weighting $\omega\colon V(G)\to\mathbb{R}$ and any list assignment $L\colon E(G)\to2^{\mathbb{R}}$ with $|L(e)|\geq |E(G)|+k$ there exists an edge labeling $f$ such that $f(e)\in L(e)$ for ...
Berikkyzy, Zhanar +4 more
core +3 more sources
On Antimagic Labeling for Some Families of Graphs
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2023 Antimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct.
Noor K. Shawkat, Mohammed A. Ahmed
doaj +1 more source
Computing Edge Weights of Magic Labeling on Rooted Products of Graphs
Mathematical Problems in Engineering, Volume 2020, Issue 1, 2020., 2020 Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications in the fields of civil, software, electrical, and network engineering. For example, in network engineering, any systems interconnected in a network can be converted into a graph and specific numeric labels assigned to the converted graph under certain ...
Jia-Bao Liu +3 more
wiley +1 more source
On the (Consecutively) Super Edge‐Magic Deficiency of Subdivision of Double Stars
Journal of Mathematics, Volume 2020, Issue 1, 2020., 2020 Let G be a finite, simple, and undirected graph with vertex set V(G) and edge set E(G). A super edge‐magic labeling of G is a bijection f : V(G) ∪ E(G)⟶{1,2, …, |V(G)| + |E(G)|} such that f(V(G)) = {1,2, …, |V(G)|} and f(u) + f(uv) + f(v) is a constant for every edge uv ∈ E(G).
Vira Hari Krisnawati +4 more
wiley +1 more source
Tree‐Antimagicness of Web Graphs and Their Disjoint Union
Mathematical Problems in Engineering, Volume 2020, Issue 1, 2020., 2020 In graph theory, the graph labeling is the assignment of labels (represented by integers) to edges and/or vertices of a graph. For a graph G = (V, E), with vertex set V and edge set E, a function from V to a set of labels is called a vertex labeling of a graph, and the graph with such a function defined is called a vertex‐labeled graph.
Zhijun Zhang +6 more
wiley +1 more source
The Integer-antimagic Spectra of Graphs with a Chord
Theory and Applications of Graphs, 2021 Let $A$ be a nontrival abelian group. A connected 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(
Richard Low, Dan Roberts, Jinze Zheng
doaj +1 more source
H‐Coverings of Path‐Amalgamated Ladders and Fans
Mathematical Problems in Engineering, Volume 2020, Issue 1, 2020., 2020 Let G be a connected, simple graph with finite vertices v and edges e. A family G1,G2,…,Gp⊂G of subgraphs such that for all e ∈ E, e∈Gl, for some l, l = 1,2, …, p is an edge‐covering of G. If Gl≅ℍ, ∀l, then G has an ℍ‐covering. Graph G with ℍ‐covering is an (ad, d)‐ℍ‐antimagic if ψ:VG∪EG⟶1,2,…,v+e a bijection exists and the sum over all vertex‐weights ...
Yijun Xiong +6 more
wiley +1 more source