Results 61 to 70 of about 1,609,249 (128)
Local antimagic vertex coloring of unicyclic graphs
Indonesian Journal of Combinatorics, 2018 The local antimagic labeling on a graph G with |V| vertices and |E| edges is defined to be an assignment f : E --> {1, 2,..., |E|} so that the weights of any two adjacent vertices u and v are distinct, that is, w(u)̸ ̸= w(v) where w(u) = Σe∈E(u) f(e)
Nuris Hisan Nazula, S Slamin, D Dafik
doaj +1 more source
Vertex Antimagic Total Labeling of Digraphs
Kyungpook mathematical journal, 2015 In this paper we investigate the properties of (a, d)-vertex antimagic total labeling of a digraph D = (V, A). In this labeling, we assign to the vertices and arcs the consecutive integers from 1 to |V|+|A| and calculate the sum of labels at each vertex, i.e., the vertex label added to the labels on its out arcs.
J. PANDIMADEVI, S.P. SUBBIAH
openaire +2 more sources
On super (a,d)-Ph-antimagic total labeling of Stars
AKCE International Journal of Graphs and Combinatorics, 2015 Let G=(V,E) be a simple graph and H be a subgraph of G. G admits an H-covering, if every edge in E(G) belongs to at least one subgraph of G that is isomorphic to H. An (a,d)-H-antimagic total labeling of G is bijection f:V(G)∪E(G)→{1,2,3,…,|V(G)|+|E(G)|}
S. David Laurence, KM. Kathiresan
doaj +1 more source
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
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 +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