Results 101 to 110 of about 412,708 (144)
QSPR graph model to explore physicochemical properties of potential antiviral drugs of dengue disease through novel coloring-based topological indices. [PDF]
Front ChemYogalakshmi C, Balamurugan BJ.
europepmc +1 more source
Some Results on Local Distance Antimagic Chromatic Number of Graphs
Let G=(V,E) be a graph of order n without isolated vertices. A bijection f:V -- {1,2,...n} is called a local distance antimagic labeling if the weights of any two adjacent vertices are not equal, where the weight of a vertex is defined to be the sum of ...
Singh, Tarkeshwar +1 more
core
On local antimagic chromatic number of the join of two special families of graphs -- II [PDF]
It is known that null graphs and 1-regular graphs are the only regular graphs without local antimagic chromatic number. In this paper, we proved that the join of 1-regular graph and a null graph has local antimagic chromatic number is 3. Consequently, we
Lau, Gee-Choon, Shiu, Wai Chee
core
Shifted-Antimagic Labelings for Graphs [PDF]
Graphs and Combinatorics, 2021 The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges through consecutive numbers starting from one. A long-standing conjecture is that every connected graph, except a single edge, is antimagic. Some graphs are known to be antimagic, but little has been known about sparse graphs, not even trees.
Hong Bin Chen, Wei-Tian Li
exaly +6 more sources
Discrete Mathematics, 2007 For a graph G = (V ,E), a bijection g from V (G) ∪ E(G) into {1, 2, . . . , |V (G)| + |E(G)|} is called (a, d)-edge-antimagic total labeling of G if the edge-weights w(xy) = g(x) + g(y) + g(xy), xy belong to E(G), form an arithmetic progression starting ...
Martin Baca
exaly +3 more sources
Dense graphs are antimagic [PDF]
Journal of Graph Theory, 2004 AbstractAn antimagic labeling of graph a with m edges and n vertices is a bijection from the set of edges 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 the same vertex. A graph is called antimagic if it has an antimagic labeling. A conjecture of Ringel (see 4)
Noga Alon +4 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Graph antimagic labeling: A survey
Discrete Mathematics, Algorithms and Applications, 2023An antimagic labeling of a simple graph [Formula: see text] is a bijection [Formula: see text] such that [Formula: see text] for any two vertices [Formula: see text] in [Formula: see text]. We survey the results about antimagic labelings and other labelings motivated by antimagic labelings of graphs, and present some conjectures and open questions.
Jingxiang Jin, Zhuojie Tu
openaire +3 more sources
Perfectly antimagic total graphs
Journal of Intelligent & Fuzzy Systems, 2023An one-one correspondence function λ from V(G) ∪ E(G) to the set {1, 2, …, |V(G) | + |E(G) |} is a total labeling of a finite undirected graph G without loops and multiple edges, where |V(G) |and |E(G) | are the cardinality of vertex and edge set of G respectively.
P. Swathi +3 more
openaire +1 more source
Antimagic Labeling of Cubic Graphs
Journal of Graph Theory, 2014Summary: An antimagic labeling of a graph \(G\) is a one-to-one correspondence between \(E(G)\) and \(\{1,2,\ldots,|E|\}\) such that the sum of the labels assigned to edges incident to distinct vertices are different. If \(G\) has an antimagic labeling, then we say \(G\) is antimagic. This article proves that cubic graphs are antimagic.
Xuding Zhu, Yu-Chang Liang
exaly +3 more sources
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