Results 41 to 50 of about 935 (138)
On The Local Edge Antimagic Coloring of Corona Product of Path and Cycle
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2019 Let be a nontrivial and connected graph of vertex set and edge set . A bijection is called a local edge antimagic labeling if for any two adjacent edges and , where for . Thus, the local edge antimagic labeling induces a proper edge coloring of G if
Siti Aisyah +4 more
doaj +1 more source
Proof of a local antimagic conjecture [PDF]
, 2018 An antimagic labelling of a graph $G$ is a bijection $f:E(G)\to\{1,\ldots,E(G)\}$ such that the sums $S_v=\sum_{e\ni v}f(e)$ distinguish all vertices. A well-known conjecture of Hartsfield and Ringel (1994) is that every connected graph other than $K_2 ...
Haslegrave, John
core +2 more sources
On the Construction of the Reflexive Vertex k‐Labeling of Any Graph with Pendant Vertex
International Journal of Mathematics and Mathematical Sciences, Volume 2020, Issue 1, 2020., 2020 A total k‐labeling is a function fe from the edge set to first natural number ke and a function fv from the vertex set to non negative even number up to 2kv, where k = max{ke, 2kv}. A vertex irregular reflexive k -labeling of a simple, undirected, and finite graph G is total k‐labeling, if for every two different vertices x and x′ of G, wt(x) ≠ wt(x′),
I. H. Agustin +5 more
wiley +1 more source
On super --antimagic total labeling of disjoint union of cycles
AKCE International Journal of Graphs and Combinatorics, 2018 Let and be finite simple graphs where every edge of belongs to at least one subgraph that is isomorphic to . An --antimagic total labeling of a graph is a bijection such that for all subgraphs isomorphic to , the -weights, form an arithmetic progression ...
Faisal Susanto
doaj +2 more sources
Trees whose even-degree vertices induce a path are antimagic [PDF]
, 2019 An antimagic labeling a connected graph $G$ is a bijection from the set of edges $E(G)$ to $\{1,2,\dots,|E(G)|\}$ such that all vertex sums are pairwise distinct, where the vertex sum at vertex $v$ is the sum of the labels assigned to edges incident to ...
Lozano, Antoni +3 more
core +3 more sources
Super -edge antimagic total labeling of a subclass of trees
AKCE International Journal of Graphs and Combinatorics, 2017 A graph labeling is a mapping that assigns numbers to graph elements. The domain can be the set of all vertices, the set of all edges or the set of all vertices and edges.
M. Javaid, A.A. Bhatti, M.K. Aslam
doaj +1 more source
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
On (a,d)-antimagic labelings of Hn, FLn and mCn
Indonesian Journal of Combinatorics, 2020 In this paper, we derive the necessary condition for an (a,d )- antimagic labeling of some new classes of graphs such as Hn, F Ln and mCn. We prove that Hn is (7n +2, 1)-antimagic and mCn is ((mn+3)/2,1)- antimagic.
Ramalakshmi Rajendran, K. M. Kathiresan
doaj +1 more source
A note on incomplete regular tournaments with handicap two of order n≡8(mod 16) [PDF]
Opuscula Mathematica, 2017 A \(d\)-handicap distance antimagic labeling of a graph \(G=(V,E)\) with \(n\) vertices is a bijection \(f:V\to \{1,2,\ldots ,n\}\) with the property that \(f(x_i)=i\) and the sequence of weights \(w(x_1),w(x_2),\ldots,w(x_n)\) (where \(w(x_i)=\sum_{x_i
Dalibor Froncek
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