Results 21 to 30 of about 956 (135)
Barekeng, 2023 Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow
R Adawiyah +4 more
doaj +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
On Elegant Labelling and Magic Labelling of Large‐Scale Graphs
Discrete Dynamics in Nature and Society, Volume 2022, Issue 1, 2022., 2022 In this paper, we deduce the equivalence relationship among strongly c‐elegant labelling, super‐edge magic total labelling, edge antimagic total labelling, and super (t, 1)‐magical labelling. We study some properties of the graph with a strongly c‐elegant labelling.
Jing Su +3 more
wiley +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
Every graph is local antimagic total and its applications [PDF]
Opuscula Mathematica, 2023 Let \(G = (V,E)\) be a simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling. A bijection \(g : E \to \{1,2,\ldots,q\}\) is called a local antimagic labeling of \(G\)
Gee-Choon Lau +2 more
doaj +1 more source
On Hamilton‐Connectivity and Detour Index of Certain Families of Convex Polytopes
Mathematical Problems in Engineering, Volume 2021, Issue 1, 2021., 2021 A convex polytope is the convex hull of a finite set of points in the Euclidean space ℝn. By preserving the adjacency‐incidence relation between vertices of a polytope, its structural graph is constructed. A graph is called Hamilton‐connected if there exists at least one Hamiltonian path between any of its two vertices.
Sakander Hayat +6 more
wiley +1 more source
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
Complexity, Volume 2021, Issue 1, 2021., 2021 A connected graph is called Hamilton‐connected if there exists a Hamiltonian path between any pair of its vertices. Determining whether a graph is Hamilton‐connected is an NP‐complete problem. Hamiltonian and Hamilton‐connected graphs have diverse applications in computer science and electrical engineering.
Sakander Hayat +4 more
wiley +1 more source
Distance Antimagic Product Graphs
Symmetry, 2022 A distance antimagic graph is a graph G admitting a bijection f:V(G)→{1,2,…,|V(G)|} such that for two distinct vertices x and y, ω(x)≠ω(y), where ω(x)=∑y∈N(x)f(y), for N(x) the open neighborhood of x. It was conjectured that a graph G is distance antimagic if and only if G contains no two vertices with the same open neighborhood.
Rinovia Simanjuntak, Aholiab Tritama
openaire +1 more source
Enumeration of the Edge Weights of Symmetrically Designed Graphs
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 The idea of super (a, 0)‐edge‐antimagic labeling of graphs had been introduced by Enomoto et al. in the late nineties. This article addresses super (a, 0)‐edge‐antimagic labeling of a biparametric family of pancyclic graphs. We also present the aforesaid labeling on the disjoint union of graphs comprising upon copies of C4 and different trees.
Muhammad Javaid +3 more
wiley +1 more source
A Conjecture on Super Edge‐Magic Total Labeling of 4‐Cycle Books
International Journal of Mathematics and Mathematical Sciences, Volume 2021, Issue 1, 2021., 2021 A graph G is called cycle books B[(4, m), 2] if G consists of m cycles C4 with a common path P2. Figueroa‐Centeno, Ichishima, and Muntaner‐Batle conjecture that the graph B[(4, m), 2] is super edge‐magic total if and only if m is even or m ≡ 5 mod(8). In this article, we prove this conjecture for m ≥ 36 and m = 0 mod (2).
Mudin Simanihuruk +5 more
wiley +1 more source