Results 21 to 30 of about 15,842 (155)

The Application of Fault-Tolerant Partition Resolvability in Cycle-Related Graphs

Applied Sciences, 2022
The concept of metric-related parameters permeates all of graph theory and plays an important role in diverse networks, such as social networks, computer networks, biological networks and neural networks.
Kamran Azhar, Sohail Zafar, Agha Kashif, Amer Aljaedi, Umar Albalawi   +4 more
doaj   +1 more source

Bounds for metric dimension and defensive $k$-alliance of graphs under deleted lexicographic product [PDF]

Transactions on Combinatorics, 2020
‎Metric dimension and defensive $k$-alliance number are two distance-based graph invariants‎ ‎which have applications in robot navigation‎, ‎quantitative analysis of secondary RNA structures‎, ‎national defense and fault-tolerant computing‎.
Kinkar Chandra Das, Mostafa Tavakoli
doaj   +1 more source

Sequential Circuit Design for Embedded Cryptographic Applications Resilient to Adversarial Faults [PDF]

, 2007
In the relatively young field of fault-tolerant cryptography, the main research effort has focused exclusively on the protection of the data path of cryptographic circuits.
Gaubatz, Gunnar, Savas, Erkay, Savaş, Erkay, Sunar, Berk   +3 more
core   +4 more sources

The Fault-Tolerant Metric Dimension of Cographs [PDF]

, 2019
arXiv admin note: text overlap with arXiv:1806 ...
Duygu Vietz, Egon Wanke
openaire   +2 more sources

Enhanced fault-tolerant quantum computing in $d$-level systems [PDF]

, 2014
Error correcting codes protect quantum information and form the basis of fault tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transverse non-Clifford gate.
Campbell, Earl T.
core   +2 more sources

Fault-Tolerant Resolvability in Some Classes of Subdivision Graphs

Journal of Mathematics, 2022
The concept of resolving sets (RSs) and metric dimension (MD) invariants have a wide range of applications in robot navigation, computer networks, and chemical structure. RS has been used as a sensor in an indoor positioning system to find an interrupter.
Muhammad Faheem, Zohaib Zahid, Dalal Alrowaili, Imran Siddique, Aiyared Iampan   +4 more
doaj   +1 more source

Optimal Fault-Tolerant Resolving Set of Power Paths

Mathematics, 2023
In a simple connected undirected graph G, an ordered set R of vertices is called a resolving set if for every pair of distinct vertices u and v, there is a vertex w∈R such that d(u,w)≠d(v,w).
Laxman Saha, Rupen Lama, Bapan Das, Avishek Adhikari, Kinkar Chandra Das   +4 more
doaj   +1 more source

Fault-Tolerant Resolvability and Extremal Structures of Graphs

Mathematics, 2019
In this paper, we consider fault-tolerant resolving sets in graphs. We characterize n-vertex graphs with fault-tolerant metric dimension n, n − 1 , and 2, which are the lower and upper extremal cases.
Hassan Raza, Sakander Hayat, Muhammad Imran, Xiang-Feng Pan   +3 more
doaj   +1 more source

Computation of Edge Resolvability of Benzenoid Tripod Structure

Journal of Mathematics, 2021
In chemistry, graphs are commonly used to show the structure of chemical compounds, with nodes and edges representing the atom and bond types, respectively.
Ali Ahmad, Sadia Husain, Muhammad Azeem, Kashif Elahi, M. K. Siddiqui   +4 more
doaj   +1 more source

Universal Fault-Tolerant Computation on Decoherence-Free Subspaces [PDF]

, 2000
A general scheme to perform universal quantum computation within decoherence-free subspaces (DFSs) of a system's Hilbert space is presented. This scheme leads to the first fault-tolerant realization of universal quantum computation on DFSs with the ...
A. M. Steane, A. R. Calderbank, B. E. Kane, C. P. Slichter, D. A. Lidar, D. A. Lidar, D. A. Lidar, D. A. Lidar, D. Bacon, D. Bacon, D. Gottesman, D. Gottesman, D. Loss, D. P. DiVincenzo, E. Knill, E. Knill, E. M. Rains, G. Burkard, J. Kempe, J. Preskill, K. B. Whaley, L.-M. Duan, M. B. Ruskai, P. Zanardi, P. Zanardi, P. Zanardi, S. Lloyd, X. Hu   +27 more
core   +2 more sources