Results 131 to 140 of about 580,661 (153)

Antimagic labeling of cubic graphs

J. Graph Theory, 2014
Summary: 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.
Yu-Chang Liang, Xuding Zhu
openaire   +2 more sources

Antimagic labelling of vertex weighted graphs

Journal of Graph Theory, 2011
AbstractSuppose 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

2012
An 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., 2017
A 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, Slamin, Tanna, Dushyant, Semaničová-Feňovčíková, Andrea, Bača, Martin   +4 more
openaire   +1 more source

Innovative Perspectives on Antimagic Labeling in Graphs

International Journal of Mathematics and Computer Science
The 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, Jeyabalan, R., Nishanthini, R., Swathi, P., Rajchakit, G.   +4 more
openaire   +1 more source

Antimagic valuations of generalized Petersen graphs

Australas. J Comb., 2000
Let \(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

On the Study of Rainbow Antimagic Connection Number of Comb Product of Friendship Graph and Tree

Symmetry, 2023
Brian Juned Septory
exaly  

A class of totally antimagic total graphs

Australas. J Comb., 2016
Summary: A total labeling of a graph \(G\) is a bijection from the vertex set and edge set of \(G\) onto the set \(\{1,2,\dots,|V(G)|+|E(G)|\}\). Such a labeling \(\xi\) is vertex-antimagic (edge-antimagic) if all vertex-weights \(wt\xi (v)=\xi(v)+\sum_{vu\in E(G)}\xi(vu)\), \(v\in V(G)\), (all edge-weights \(wt_\xi(vu)=\xi(v)+\xi(vu)+\xi(u)\), \(vu\in
openaire   +2 more sources

Regular bipartite graphs are antimagic

Journal of Graph Theory, 2009
Daniel Cranston
exaly  

Antimagic labelling of vertex weighted graphs

Journal of Graph Theory, 2012
Xuding Zhu
exaly