Results 21 to 30 of about 412,708 (144)
Group-antimagic Labelings of Multi-cyclic Graphs [PDF]
Theory and Applications of Graphs, 2016 Let $A$ be a non-trivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimagic} if there exists an edge labeling $f: E(G) \to A \backslash \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \Sigma$
Dan Roberts, Richard Low
doaj +2 more sources
The integer-antimagic spectra of Hamiltonian graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2021 Let A be a nontrivial abelian group. A connected simple graph G = (V, E) is A-antimagic, if there exists an edge labeling f : E(G)→A ∖ {0A} such that the induced vertex labeling f+(v)=∑{u, v}∈E(G)f({u, v}) is a one-to-one map.
Ugur Odabasi +2 more
doaj +2 more sources
On d-antimagic labelings of plane graphs
Electronic Journal of Graph Theory and Applications, 2013 The paper deals with the problem of labeling the vertices and edges of a plane graph in such a way that the labels of the vertices and edges surrounding that face add up to a weight of that face.
Martin Baca +4 more
doaj +4 more sources
Product Antimagic Labeling of Caterpillars
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 Let G be a graph with m edges. A product antimagic labeling of G is a bijection from the edge set E(G) to the set {1,2, …, m} such that the vertex‐products are pairwise distinct, where the vertex‐product of a vertex v is the product of labels on the incident edges of v. A graph is called product antimagic if it admits a product antimagic labeling.
Shengze Wang +2 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
On Antimagic Labeling for Some Families of Graphs
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2023 Antimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct.
Noor K. Shawkat, Mohammed A. Ahmed
doaj +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
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
Super H‐Antimagic Total Covering for Generalized Antiprism and Toroidal Octagonal Map
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 Let G be a graph and H⊆G be subgraph of G. The graph G is said to be (a, d)‐H antimagic total graph if there exists a bijective function f : V(H) ∪ E(H)⟶{1,2,3, …, |V(H)| + |E(H)|} such that, for all subgraphs isomorphic to H, the total H weights W(H) = W(H) = ∑x∈V(H)f(x) + ∑y∈E(H)f(y) forms an arithmetic sequence a, a + d, a + 2d, …, a + (n − 1)d ...
Amir Taimur +5 more
wiley +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