Results 231 to 240 of about 1,645 (243)
Some of the next articles are maybe not open access.
Expert systems
Fault‐tolerant monitoring and reliable node identification are essential requirements in modern hierarchical communication systems such as IoT–Fog–Cloud architectures and distributed sensing networks. The fault‐tolerant metric dimension (FTMD) provides
Ghulam Haidar +5 more
semanticscholar +1 more source
Fault‐tolerant monitoring and reliable node identification are essential requirements in modern hierarchical communication systems such as IoT–Fog–Cloud architectures and distributed sensing networks. The fault‐tolerant metric dimension (FTMD) provides
Ghulam Haidar +5 more
semanticscholar +1 more source
Fault-tolerant dominant metric dimension of graphs
Asian-European Journal of MathematicsThe behavior of a graph via distance-based parameters has been widely used in various applications of daily life problems and in diverse disciplines including operation research, drug discovery, sensor networking, source localization, comparing interconnected networks, detection of network motifs, robot navigation, and image processing.
Imtiaz Ali, Muhammad Javaid, Yilun Shang
openaire +1 more source
Fault-tolerant metric dimension of annihilator graphs of commutative rings
Summary: Let \(R\) be a commutative ring with identity. The annihilator graph \(AG (R)\) is a simple graph with vertex set as the set of all non-zero zero-divisors of \(R\), and two distinct vertices \(a\) and \(b\) are adjacent if and only if \(ann_R (a) \cup ann_R (b) \neq ann_R (a \cdot b)\).M S, AKHILA, K, Manilal
openaire +2 more sources
Fault-Tolerant Metric Dimension of Some Convex Polytope Graphs
Advances in Applied Mathematics高闵 宣
openaire +2 more sources
2025 1st International Conference on Emerging Innovation and Digital Technology (ICEIDT)
Johnson graphs J(n, k) are well-studied class of combinatorial graphs, arising naturally in coding theory, design theory, and interconnection networks due to their rich symmetry and structural properties.
Libin Bright J M, S. F
semanticscholar +1 more source
Johnson graphs J(n, k) are well-studied class of combinatorial graphs, arising naturally in coding theory, design theory, and interconnection networks due to their rich symmetry and structural properties.
Libin Bright J M, S. F
semanticscholar +1 more source
2026 Sixth International Conference on Advances in Electrical, Computing, Communications and Sustainable Technologies (ICAECT)
Efficient and fault-tolerant communication networks demand topologies that can uniquely identify nodes and recover from single-point failures. The metric dimension of a graph provides a mathematical foundation for such identification using carefully ...
Abigail M V, S. F
semanticscholar +1 more source
Efficient and fault-tolerant communication networks demand topologies that can uniquely identify nodes and recover from single-point failures. The metric dimension of a graph provides a mathematical foundation for such identification using carefully ...
Abigail M V, S. F
semanticscholar +1 more source
On Metric Dimension and Fault Tolerant Metric Dimension of Some Chemical Structures
Polycyclic Aromatic Compounds, 2022Muhammad Faisal Nadeem +2 more
exaly
Fault-tolerant metric dimension of zero-divisor graphs of commutative rings
AKCE International Journal of Graphs and Combinatorics, 2022Vijay Kumar Bhat
exaly
Fault-tolerant metric dimension of some plane graphs
Discrete and Continuous Dynamical Systems. Series AKairui Nie +3 more
semanticscholar +1 more source
On Fault-Tolerant Metric Dimension of Heptagonal Circular Ladder and Its Related Graphs
2023Sunny Kumar Sharma, Vijay Kumar Bhat
openaire +1 more source