Results 41 to 50 of about 20,141 (153)
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
Mathematics, 2022 Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimension n,
Sakander Hayat, Asad Khan, Yubin Zhong
doaj +1 more source
IEEE AccessIn the aircraft sector, honeycomb composite materials are frequently employed. Recent research has demonstrated the benefits of honeycomb structures in applications involving nanohole arrays in anodized alumina, micro-porous arrays in polymer thin films,
Sidra Bukhari +3 more
doaj +1 more source
Fault-Tolerant Edge Metric Dimension of Zero-Divisor Graphs of Commutative Rings
AxiomsIn recent years, the intersection of algebraic structures and graph-theoretic concepts has developed significant interest, particularly through the study of zero-divisor graphs derived from commutative rings.
Omaima Alshanquiti +2 more
doaj +1 more source
The Vertex-Edge Resolvability of Some Wheel-Related Graphs
Journal of Mathematics, 2021 A vertex w∈VH distinguishes (or resolves) two elements (edges or vertices) a,z∈VH∪EH if dw,a≠dw,z. A set Wm of vertices in a nontrivial connected graph H is said to be a mixed resolving set for H if every two different elements (edges and vertices) of H ...
Bao-Hua Xing +4 more
doaj +1 more source
Barycentric Subdivision of Cayley Graphs With Constant Edge Metric Dimension
IEEE Access, 2020 A motion of a robot in space is represented by a graph. A robot change its position from point to point and its position can be determined itself by distinct labelled landmarks points.
Ali N. A. Koam, Ali Ahmad
doaj +1 more source
On the Constant Edge Resolvability of Some Unicyclic and Multicyclic Graphs
Journal of Mathematics, 2022 Assume that G=VG,EG is a connected graph. For a set of vertices WE⊆VG, two edges g1,g2∈EG are distinguished by a vertex x1∈WE, if dx1,g1≠dx1,g2. WE is termed edge metric generator for G if any vertex of WE distinguishes every two arbitrarily distinct ...
Dalal Alrowaili +5 more
doaj +1 more source
Edge metric dimension of some classes of circulant graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 Let G = (V (G), E(G)) be a connected graph and x, y ∈ V (G), d(x, y) = min{ length of x − y path } and for e ∈ E(G), d(x, e) = min{d(x, a), d(x, b)}, where e = ab. A vertex x distinguishes two edges e1 and e2, if d(e1, x) ≠ d(e2, x). Let WE = {w1, w2, . .
Ahsan Muhammad +2 more
doaj +1 more source
Vertex and edge resolvability of some drug structures
Results in ChemistryDistance-based parameters are crucial in studying drug structures as they help in uniquely identifying and characterizing the molecular structure through the analysis of graph representations, thereby aiding in the understanding of molecular properties ...
Ayesha Andalib Kiran +3 more
doaj +1 more source
DIMENSI METRIK GRAF HASIL OPERASI JEMBATAN DARI CATERPILLAR HOMOGEN DAN POT BUNGA DIPERUMUM
Majalah Ilmiah Matematika dan Statistika, 2022 The metric dimension is a concept that has many applications, such as robotic navigation. This concept will distinguish each vertex of a graph based on some vertices. The distinguishing vertices are called the basis of the graph.
Gusma Hidayanti +3 more
doaj +1 more source
The edge partition dimension of graphs [PDF]
Discrete Mathematics Letters, 2023 Dorota Kuziak +3 more
doaj +1 more source