Results 111 to 119 of about 920 (119)
Some of the next articles are maybe not open access.
Local Antimagic Vertex Coloring of a Graph
Graphs and Combinatorics, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arumugam, S. +3 more
openaire +1 more source
Some Distance Antimagic Labeled Graphs
2016Let G be a graph of order n. A bijection $$f:VG \longrightarrow \{1, 2, \ldots , n\}$$ is said to be distance antimagic if for every vertex v the vertex weight defined by $$w_fv =\sum _{x\in Nv}fx$$ is distinct. The graph which admits such a labeling is called a distance antimagic graph. For a positive integer k, define $$f_{k}:VG \longrightarrow \{1+k,
Adarsh K. Handa +2 more
openaire +1 more source
Antimagic labeling for subdivisions of graphs
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Innovative Perspectives on Antimagic Labeling in Graphs
International Journal of Mathematics and Computer ScienceThe graph G represents an undirected, simple, finite graph. G's total labeling is a bijection between its vertex and edge sets and the set {1, 2,..., p+q}, where p and q describe the cardinality of G's vertex and edge sets, respectively. In this paper, we explore the concept of Super Vertex Perfectly Total Antimagic (SVPTAT) labeling in the context of
Sundar, S. Bala +4 more
openaire +1 more source
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
Antimagic labeling of pumpkin graph
Bulletin of Pure & Applied Sciences- Mathematics and Statistics, 2022Jeba J. Jesintha +2 more
openaire +1 more source
Antimagic Labeling of Cubic Graphs
Journal of Graph Theory, 2013Yu-Chang Liang, Xuding Zhu
openaire +1 more source