Results 21 to 30 of about 920 (119)
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 +2 more sources
Shifted-Antimagic Labelings for Graphs [PDF]
Graphs and Combinatorics, 2021 The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges through consecutive numbers starting from one. A long-standing conjecture is that every connected graph, except a single edge, is antimagic. Some graphs are known to be antimagic, but little has been known about sparse graphs, not even trees.
Fei-Huang Chang +3 more
openaire +3 more sources
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
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
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
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
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
Trees Whose Even-Degree Vertices Induce a Path are Antimagic
Discussiones Mathematicae Graph Theory, 2022 An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . ., |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 v.
Lozano Antoni +3 more
doaj +1 more source
New Perspectives on Classical Meanness of Some Ladder Graphs
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 In this study, we investigate a new kind of mean labeling of graph. The ladder graph plays an important role in the area of communication networks, coding theory, and transportation engineering. Also, we found interesting new results corresponding to classical mean labeling for some ladder‐related graphs and corona of ladder graphs with suitable ...
A. M. Alanazi +4 more
wiley +1 more source