Results 21 to 30 of about 580,661 (153)
Caterpillars Have Antimagic Orientations [PDF]
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018 An antimagic labeling of a directed graph D with m arcs is a bijection from the set of arcs of D to {1, …, m} such that all oriented vertex sums of vertices in D are pairwise distinct, where the oriented vertex sum of a vertex u is the sum of labels of ...
Lozano Antoni
doaj +2 more sources
Vertex-antimagic total labelings of graphs
Discussiones Mathematicae Graph Theory, 2003 The paper introduces a new type of labeling, the \((a,d)\)-vertex-antimagic total labeling. Let \(G\) be a graph with \(n\) vertices and \(e\) edges. Assign different labels to every edge and every vertex of the graph from the set \(\{1,2,\dots,n+ e\}\). For every vertex add the label of the vertex and the labels of the incident edges.
Martin Baca +5 more
openaire +4 more sources
On (a,1)-Vertex-Antimagic Edge Labeling of Regular Graphs
Journal of Applied Mathematics, 2015 An (a,s)-vertex-antimagic edge labeling (or an (a,s)-VAE labeling, for short) of G is a bijective mapping from the edge set E(G) of a graph G to the set of integers 1,2,…,|E(G)| with the property that the vertex-weights form an arithmetic sequence ...
Martin Bača +3 more
doaj +2 more sources
On H-Supermagic Labelings of m-Shadow of Paths and Cycles
International Journal of Mathematics and Mathematical Sciences, 2019 A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgraph isomorphic to H. A bijection f:V∪E→{1,2,3,…,V+E} is an (a,d)-H-antimagic total labeling of G if, for all subgraphs H′ isomorphic to H, the sum of ...
Ika Hesti Agustin +5 more
doaj +2 more sources
On local antimagic vertex coloring of corona products related to friendship and fan graph [PDF]
Indonesian Journal of Combinatorics, 2021 Let G=(V,E) be connected graph. A bijection f : E → {1,2,3,..., |E|} is a local antimagic of G if any adjacent vertices u,v ∈ V satisfies w(u)≠ w(v), where w(u)=∑e∈E(u) f(e), E(u) is the set of edges incident to u. When vertex u is assigned the color w(u)
Zein Rasyid Himami, Denny Riama Silaban
doaj +2 more sources
Group-antimagic Labelings of Multi-cyclic Graphs [PDF]
Theory and Applications of Graphs, 2016 Let $A$ be a non-trivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimagic} if there exists an edge labeling $f: E(G) \to A \backslash \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \Sigma$
Dan Roberts, Richard Low
doaj +2 more sources
The integer-antimagic spectra of Hamiltonian graphs [PDF]
, 2021 Let A be a nontrivial abelian group. A connected simple graph G = (V, E) is A-antimagic, if there exists an edge labeling f : E(G)→A ∖ {0A} such that the induced vertex labeling f+(v)=∑{u, v}∈E(G)f({u, v}) is a one-to-one map.
Low, Richard M. +5 more
core +1 more source
On the study of Rainbow Antimagic Coloring of Special Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . The bijective function is said to be a labeling of graph where is the associated weight for edge .
Dafik Dafik +3 more
doaj +1 more source
Antimagic Labeling of Some Degree Splitting Graphs
Ratio Mathematica, 2023 A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. As Wang et al.
Chirag Barasara, Palak Prajapati
doaj +1 more source
Assignment Computations Based on Cexp Average in Various Ladder Graphs
Journal of Mathematics, Volume 2022, Issue 1, 2022., 2022 This study introduces the Cexp average assignments and investigates its properties using various ladder graphs. The ladder graphs can be found in every communication networks. Ladder networks are increasingly being used in everyday life for monitoring and environmental applications such as domestic, military, surveillance, industrial, medical ...
A.Rajesh Kannan +5 more
wiley +1 more source