Results 91 to 100 of about 920 (119)
Lexicographic product graphs are antimagic
AKCE International Journal of Graphs and Combinatorics, 2018 A graph with edges is called if its edges can be labeled with 1, 2, , such that the sums of the labels on the edges incident to each vertex are distinct. Hartsfield and Ringel conjectured that every connected graph other than is antimagic. In this paper, through a labeling method and a modification on this labeling, we obtained that the lexicographic ...
Wenhui Ma +3 more
openaire +1 more source
On the antimagicness of generalized edge corona graphs. [PDF]
HeliyonD N, S DY.
europepmc +1 more source
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
Book graphs are cycle antimagic
Open Journal of Mathematical Sciences, 2019 Muhammad Awais Umar +3 more
openaire +1 more source
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.
Jin, Jingxiang, Tu, Zhuojie
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
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.
Swathi, P. +3 more
openaire +1 more source
Antimagic Labelings of Join Graphs
Mathematics in Computer Science, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bača, Martin +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
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.
Hefetz, Dan +2 more
openaire +2 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.
Hefetz, Dan +2 more
openaire +2 more sources