Results 121 to 130 of about 412,708 (144)
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.
Muhammad Kamran Siddiqui +2 more
openaire +2 more sources
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
Antimagic labelling of vertex weighted graphs
Journal of Graph Theory, 2011AbstractSuppose G is a graph, k is a non‐negative integer. We say G is k‐antimagic if there is an injection f: E→{1, 2, …, |E| + k} such that for any two distinct vertices u and v, . We say G is weighted‐k‐antimagic if for any vertex weight function w: V→ℕ, there is an injection f: E→{1, 2, …, |E| + k} such that for any two distinct vertices u and v, .
Tsai-Lien Wong, Xuding Zhu
openaire +1 more source
On Antimagic Labeling of Odd Regular Graphs
2012An antimagic labeling of a finite simple undirected graph with q edges is a bijection from the set of edges to the set of integers {1, 2, ⋯ , q} such that the vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of labels of all edges incident to such vertex. A graph is called antimagic if it admits an antimagic labeling.
Tao-Ming Wang, Guang-Hui Zhang
openaire +2 more sources
Constructions Of H-Antimagic Graphs Using Smaller Edge-Antimagic Graphs.
Ars Comb., 2017A simple graph G = (V, E) admits an H-Covering if every edge in E belongs at least to one subgraph of G isomorphic to a given graph H. An (a, d)-H- antimagic labeling of G admitting an H-covering is a bijective function f : V ∪ E → {1, 2, ., ∣V∣ + ∣E∣} such that, for all subgraphs H' of G isomorphic to H, the H'-weights, et f (H') = Σ υ∈V(H') f(υ)+Σ e ...
Dafik +4 more
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
Antimagic valuations of generalized Petersen graphs
Australas. J Comb., 2000Let \(P_n=(V,E)\) denote the generalized Petersen graph with \(2n\) vertices \(u_1,\dots ,u_n,v_1,\dots ,v_n\) \((n\geq 5)\) and \(3n\) edges: \(n\) outer edges \(u_iu_{i+1},\) \(n\) inner edges \(v_iv_{i+2}\) taken modulo \(n\), and \(n\) spokes \(u_iv_i.\) A labeling \(f: E\to \{1,2,\dots ,3n\}\) is called \((a,d)\)-antimagic if the weights of ...
Mirka Miller, Martin Baca
openaire +2 more sources
Antimagic labeling and canonical decomposition of graphs
Information Processing Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source