Results 41 to 50 of about 412,708 (144)
Distance antimagic labelings of Cartesian product of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a graph of order n. Let be a bijection. The weight w(v) of a vertex v with respect to the labeling f is defined by where N(v) is the open neighborhood of v. The labeling f is called a distance antimagic labeling if for any two distinct vertices v1,
Nancy Jaseintha Cutinho +2 more
doaj +1 more source
Multi-bridge graphs are anti-magic
Electronic Journal of Graph Theory and Applications, 2022 An anti-magic graph is a graph whose |E| edges can be labeled with the first |E| natural numbers such that each edge receives a distinct number and each vertex receives a distinct vertex sum which is obtained by taking the sum of the labels of all the
Yu Bin Tai, Gek Ling Chia, Poh-Hwa Ong
doaj +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
On the Integer-antimagic Spectra of Non-Hamiltonian Graphs
Theory and Applications of Graphs, 2022 Let $A$ be a nontrivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{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) = \Sigma$ $
Wai Shiu, Richard Low
doaj +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
-super antimagic total labeling of comb product of graphs
AKCE International Journal of Graphs and Combinatorics, 2019 Let and be two simple, nontrivial and undirected graphs. Let be a vertex of , the comb product between and , denoted by , is a graph obtained by taking one copy of and copies of and grafting the th copy of at the vertex to the th vertex of .
Ika Hesti Agustin +2 more
doaj +2 more sources
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
Lexicographic product graphs P m [ P n ] are antimagic
AKCE International Journal of Graphs and Combinatorics, 2018 A graph with q edges is called a n t i m a g i c if its edges can be labeled with 1, 2, …, q such that the sums of the labels on the edges incident to each vertex are distinct.
Wenhui Ma +3 more
doaj +2 more sources
On super --antimagic total labeling of disjoint union of cycles
AKCE International Journal of Graphs and Combinatorics, 2018 Let and be finite simple graphs where every edge of belongs to at least one subgraph that is isomorphic to . An --antimagic total labeling of a graph is a bijection such that for all subgraphs isomorphic to , the -weights, form an arithmetic progression ...
Faisal Susanto
doaj +2 more sources
On the Construction of the Reflexive Vertex k‐Labeling of Any Graph with Pendant Vertex
International Journal of Mathematics and Mathematical Sciences, Volume 2020, Issue 1, 2020., 2020 A total k‐labeling is a function fe from the edge set to first natural number ke and a function fv from the vertex set to non negative even number up to 2kv, where k = max{ke, 2kv}. A vertex irregular reflexive k -labeling of a simple, undirected, and finite graph G is total k‐labeling, if for every two different vertices x and x′ of G, wt(x) ≠ wt(x′),
I. H. Agustin +5 more
wiley +1 more source