Results 91 to 100 of about 1,609,249 (128)
Some of the next articles are maybe not open access.
Computing Antimagic Labeling of Lattically Designed Symmetric Networks
IEEE Access, 2022In this article, we address the super edge-antimagic total labeling of the hexagonal lattice HTTm,n and two non-isomorphic forms of prismatic lattice PTTm,n.
H. U. Afzal, Ahmed Alamer, M. Javaid
semanticscholar +1 more source
Achieving Near-Ideal Flatness in Honeywords via Antimagic Labeling and Machine Learning
2025 4th International Conference on Artificial Intelligence, Human-Computer Interaction and Robotics (AIHCIR)With the proliferation of multi-agent authentication systems, potential threats from inter-agent authentication requests are increasing. If an agent’s credentials are compromised, the entire system becomes vulnerable to penetration or sabotage.
Wenhao Ji +4 more
semanticscholar +1 more source
Local Distance Antimagic Labeling of Generalized Mycielskian Graphs
Ars combinatoriaLet \(G=(V,E)\) be a graph of order \(n\) without isolated vertices. A bijection \(f\colon V\rightarrow \{1,2,\dots,n\}\) is called a local distance antimagic labeling, if \(w(u)\not=w(v)\) for every edge \(uv\) of \(G\), where \(w(u)=\sum_{x\in N(u)}f(x)
M. Almeida, Kingel Savia De Sa
semanticscholar +1 more source
Face Antimagic Labeling of House Graphs, Double House Graphs, and Triangular Ladder Graphs
International journal of mathematics and statistics studiesThis study investigates the (a,d)-face antimagic labeling on three classes of planar graphs, namely the house graph, the double house graph, and the triangular ladder graph. An (a,d)-face antimagic labeling is defined as a bijective function from the set
Ema Rahmah Windasari +2 more
semanticscholar +1 more source
Graceful Local Antimagic Labeling of Graphs: A Pattern Analysis Using Python
SymmetryGraph labeling is the process of assigning labels to vertices and edges under certain conditions. This paper investigates the graceful local antimagic labeling of various graph families, excluding symmetric labelings, using computational experiments and ...
Luqman Alam +2 more
semanticscholar +1 more source
Local antimagic labeling of graphs
Applied Mathematics and Computation, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu, Xiaowei +4 more
openaire +2 more sources
Antimagic Labeling of Graphs Using Prime Numbers
arXiv.orgGraph labeling is a technique that assigns unique labels or weights to the vertices or edges of a graph, often used to analyze and solve various graph-related problems. There are few methods with certain limitations conducted by researchers previously on
Arafat Islam, Md. Imtiaz Habib
semanticscholar +1 more source
Graceful and Antimagic Labelings
2019This chapter explores the relationship between antimagic labeling and alpha labelings and also the well-known graceful labelings. Much of this chapter looks at interesting labelings and structures on trees, including edge antimagic trees, alpha trees, and disjoint union of caterpillars.
Martin Bača +3 more
openaire +1 more source
E-cordial labeling of graphs and its implications for A-antimagic labeling of trees
Discrete MathematicsIf $A$ is a finite Abelian group, then a labeling $f \colon E (G) \rightarrow A$ of the edges of some graph $G$ induces a vertex labeling on $G$; the vertex $u$ receives the label $\sum_{v\in N(u)}f (v)$, where $N(u)$ is an open neighborhood of the ...
Sylwia Cichacz-Przenioslo
semanticscholar +1 more source
Edge-Antimagic Total Labelings
2019This chapter focuses on edge-antimagic graphs under both vertex labelings and total labelings. Super edge-antimagic total labelings are given for standard graphs and (a,1) edge-antimagic total labelings are introduced and explored.
Martin Bača +3 more
openaire +1 more source