Results 51 to 60 of about 920 (119)
Local edge (a, d) –antimagic coloring on sunflower, umbrella graph and its application
Alifmatika, 2023 Suppose a graph G = (V, E) is a simple, connected and finite graph with vertex set V(G) and an edge set E(G). The local edge antimagic coloring is a combination of local antimagic labelling and edge coloring.
Robiatul Adawiyah +2 more
doaj +1 more source
(Di)graph products, labelings and related results [PDF]
, 2017 Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them.
López Masip, Susana-Clara
core +4 more sources
Lexicographic product graphs P m [ P n ] are antimagic
AKCE International Journal of Graphs and Combinatorics, 2018 A graph with q edges is called a n t i m a g i c if its edges can be labeled with 1, 2, …, q such that the sums of the labels on the edges incident to each vertex are distinct.
Wenhui Ma +3 more
doaj +2 more sources
Antimagicness for a family of generalized antiprism graphs
Electronic Journal of Graph Theory and Applications, 2014 An antimagic labeling of a graph $G=(V,E)$ is a bijection from the set of edges $E$ to the set of integers $\{1,2,\dots, |E|\}$ such that all vertex weights are pairwise distinct, where the weight of a vertex is the sum of all edge labels incident with ...
Dominique Buset +3 more
doaj +1 more source
Ideal Basis in Constructions Defined by Directed Graphs [PDF]
, 2015 The present article continues the investigation of visible ideal bases in constructions defined using directed graphs. This notion is motivated by its applications for the design of classication systems.
Abawajy, J. (Jemal) +2 more
core +2 more sources
Antimagic Orientation of Biregular Bipartite Graphs
The Electronic Journal of Combinatorics, 2017 An antimagic labeling of a directed graph $D$ with $n$ vertices and $m$ arcs is a bijection from the set of arcs of $D$ to the integers $\{1, \cdots, m\}$ such that all $n$ oriented vertex sums are pairwise distinct, where an oriented vertex sum is the sum of labels of all arcs entering that vertex minus the sum of labels of all arcs leaving it.
Shan, Songling, Yu, Xiaowei
openaire +3 more sources
Distance antimagic labeling of join and corona of two graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph of order . Let be a bijection. The weight of a vertex with respect to is defined by , where is the open neighborhood of . The labeling is said to be distance antimagic if for every pair of distinct vertices .
A.K. Handa +3 more
doaj +1 more source
Integer-antimagic spectra of disjoint unions of cycles
Theory and Applications of Graphs, 2018 Let $A$ be a non-trivial abelian group. A simple graph $G = (V, E)$ is $A$-antimagic if there exists an edge labeling $f: E(G) \to A \setminus \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \sum_{uv\in E(G)}f(uv ...
Wai Chee Shiu
doaj +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
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.
Bača, Martin +5 more
openaire +2 more sources