Results 121 to 130 of about 580,661 (153)
Some of the next articles are maybe not open access.
Journal of Graph Theory, 2009
AbstractAn antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, …, m} such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it admits an antimagic labeling.
Dan Hefetz +2 more
openaire +3 more sources
AbstractAn antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, …, m} such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it admits an antimagic labeling.
Dan Hefetz +2 more
openaire +3 more sources
Antimagic Labelings of Join Graphs
Mathematics in Computer Science, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Baca +3 more
openaire +1 more source
ON -ANTIMAGICNESS OF DISCONNECTED GRAPHS
Bulletin of the Australian Mathematical Society, 2016A simple graph$G=(V,E)$admits an$H$-covering if every edge in$E$belongs to at least one subgraph of$G$isomorphic to a given graph$H$. Then the graph$G$is$(a,d)$-$H$-antimagic if there exists a bijection$f:V\cup E\rightarrow \{1,2,\ldots ,|V|+|E|\}$such that, for all subgraphs$H^{\prime }$of$G$isomorphic to$H$, the$H^{\prime }$-weights,$wt_{f}(H^{\prime
Bača, Martin +3 more
openaire +2 more sources
Aequationes mathematicae, 2022
Graceful labeling and antimagic labeling are two significant topics in the domain of graph labelings, with outstanding conjectures which still remain unsolved. In this paper, the authors combine these two concepts to define a new labeling, called graceful antimagic labelings. Graceful antimagicness of some families of trees, cycles, and nearly complete
Mohammed Ali Ahmed +4 more
openaire +2 more sources
Graceful labeling and antimagic labeling are two significant topics in the domain of graph labelings, with outstanding conjectures which still remain unsolved. In this paper, the authors combine these two concepts to define a new labeling, called graceful antimagic labelings. Graceful antimagicness of some families of trees, cycles, and nearly complete
Mohammed Ali Ahmed +4 more
openaire +2 more sources
Local antimagic labeling of graphs
Applied Mathematics and Computation, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaowei Yu +4 more
openaire +3 more sources
Antimagicness of Generalized Corona and Snowflake Graphs
Mathematics in Computer Science, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jacqueline W. Daykin +3 more
openaire +4 more sources
Distance Antimagic Labelings of Graphs
2017Let \(G=(V,E)\) be a graph of order n. Let \(f: V(G)\rightarrow \{1,2,\dots ,n\}\) be a bijection. For any vertex \(v \in V,\) the neighbor sum \(\sum \limits _{u\in N(v)}f(u)\) is called the weight of the vertex v and is denoted by w(v). If \(w(x) \ne w(y)\) for any two distinct vertices x and y, then f is called a distance antimagic labeling. A graph
Nainarraj Kamatchi +4 more
openaire +2 more sources
Regular bipartite graphs are antimagic
Journal of Graph Theory, 2008AbstractA labeling of a graph G is a bijection from E(G) to the set {1, 2,… |E(G)|}. A labeling is antimagic if for any distinct vertices u and v, the sum of the labels on edges incident to u is different from the sum of the labels on edges incident to v. We say a graph is antimagic if it has an antimagic labeling.
openaire +1 more source
On Super Edge-Antimagicness of Circulant Graphs
Graphs and Combinatorics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Baca +3 more
openaire +2 more sources
Antimagic labeling for subdivisions of graphs
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources