Results 81 to 90 of about 935 (138)
ANTIMAGIC LABELING OF GENERALIZED SAUSAGE GRAPHS [PDF]
Journal of the Indonesian Mathematical Society, 2014 An antimagic labeling of a graph with q edges is a bijection from the set of edges to the set of positive integers {1,2,...,q} such that all vertex weights are pairwise distinct, where the vertex weight of a vertex is the sum of the labels of all the edges incident with that vertex. A graph is antimagic if it has an antimagic labeling. In this paper we
openaire +1 more source
The analysis of the implementation of RBL-STEM learning materials in improving student's meta-literacy ability to solve wallpaper decoration problems using local antimagic graph coloring techniques. [PDF]
Heliyon, 2023 Dafik +4 more
europepmc +1 more source
Antimagic vertex labelings of hypergraphs
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
VERTEX ANTIMAGIC TOTAL LABELING PADA GRAPHMULTICYCLE
PYTHAGORAS Jurnal Pendidikan Matematika, 2015 Pelabelan graf merupakan bagian dari graf yang berkembang saat ini. Jenis pelabelan pada graf bergantungpada domainnya, yakni pelabelan sisi ajaib, pelabelan titik ajaib, dan pelabelan total ajaib. Pelabelan totalajaib pada graf dibedakan lagi berdasarkan komponen graf yang dievaluasi, yakni pelabelan total sisi ajaibdan pelabelan total titik ajaib ...
openaire +2 more sources
Super (a,d)-EAT labeling of subdivided stars
AKCE International Journal of Graphs and Combinatorics, 2015 Kotzig and Rosa conjectured that every tree admits an edge-magic total labeling. Enomoto et al. proposed the conjecture that every tree is a super (a,0)-edge-antimagic total graph.
M. Javaid
doaj +1 more source
Partially magic labelings and the Antimagic Graph Conjecture
, 2015 The Antimagic Graph Conjecture asserts that every connected graph $G = (V, E)$ except $K_2$ admits an edge labeling such that each label $1, 2, \dots, |E|$ is used exactly once and the sums of the labels on all edges incident to a given vertex are distinct.
Beck, Matthias, Farahmand, Maryam
openaire +3 more sources
All Graphs Have Antimagic Total Labelings
Electronic Notes in Discrete Mathematics, 2011 Abstract Let G = ( V , E ) be a finite, simple, indirected and either connected or disconnected. A antimagic total labeling of a graph G = ( V , E ) with p vertices and q edges is a bijection l : V ∪ E → { 1 , 2 , … , p + q } such that all vertex weights are pairwise distinct, where a vertex weight is the
Miller, Mirka +2 more
openaire +1 more source
Cauchy: Jurnal Matematika Murni dan AplikasiThis article discusses a local antimagic coloring which is a combination between antimagic labeling and coloring. It is a new notion. We define a vertex weight of as where is the set of edges incident to .
R. Sunder +5 more
doaj +1 more source
Distance antimagic labeling of circulant graphs
AIMS MathematicsA distance antimagic labeling of graph $ G = (V, E) $ of order $ n $ is a bijection $ f:V(G)\rightarrow \{1, 2, \ldots, n\} $ with the property that any two distinct vertices $ x $ and $ y $ satisfy $ \omega(x)\ne\omega(y) $, where $ \omega(x) $ denotes the open neighborhood sum $ \sum_{a\in N(x)}f(a) $ of a vertex $ x $. In 2013, Kamatchi and Arumugam
Syafrizal Sy +4 more
openaire +2 more sources
On local distance antimagic labeling of graphs
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be a graph of order n and let [Formula: see text] be a bijection. For every vertex [Formula: see text], we define the weight of the vertex v as [Formula: see text] where N(v) is the open neighborhood of the vertex v. The bijection
Adarsh Kumar Handa +2 more
doaj +1 more source