Results 101 to 110 of about 920 (119)
Some of the next articles are maybe not open access.
Face Antimagic Labeling of Jahangir Graph
Mathematics in Computer Science, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Siddiqui, Muhammad Kamran +2 more
openaire +1 more source
2019
Magic and antimagic labelings are among the oldest labeling schemes in graph theory. This book takes readers on a journey through these labelings, from early beginnings with magic squares up to the latest results and beyond. Starting from the very basics, the book offers a detailed account of all magic and antimagic type labelings of undirected graphs.
Baca, Martin +3 more
openaire +1 more source
Magic and antimagic labelings are among the oldest labeling schemes in graph theory. This book takes readers on a journey through these labelings, from early beginnings with magic squares up to the latest results and beyond. Starting from the very basics, the book offers a detailed account of all magic and antimagic type labelings of undirected graphs.
Baca, Martin +3 more
openaire +1 more source
Antimagicness of Generalized Corona and Snowflake Graphs
Mathematics in Computer Science, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daykin, Jacqueline W. +3 more
openaire +3 more sources
Antimagicness of Lexicographic Product Graph G[Pn]
Acta Mathematicae Applicatae Sinica, English Series, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lu, Ying-yu, Dong, Guang-hua, Wang, Ning
openaire +2 more sources
Antimagic graphs with even factors
Wuhan University Journal of Natural Sciences, 2015A labeling f of a graph G is a bijection from its edge set E(G) to the set {1, 2, ⋯, |E(G)|}, which is antimagic if for any distinct vertices x and y, the sum of the labels on edges incident to x is different from the sum of the labels on edges incident to y. A graph G is antimagic if G has an f which is antimagic.
Tao Wang, Wenjing Miao, Li Deming
openaire +1 more source
Local antimagic labeling of graphs
Applied Mathematics and Computation, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu, Xiaowei +4 more
openaire +2 more sources
Antimagic orientation of Halin graphs
Discrete Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu, Xiaowei, Chang, Yulin, Zhou, Shan
openaire +2 more sources
On Super Edge-Antimagicness of Circulant Graphs
Graphs and Combinatorics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bača, Martin +3 more
openaire +1 more source
Local antimagic orientation of graphs
Journal of Combinatorial Optimization, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yulin Chang, Fei Jing, Guanghui Wang
openaire +1 more source
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
N. Kamatchi +4 more
openaire +1 more source