Shahid Beheshti University Journal of Innovations in Computer Science and Engineering (JICSE) 2981-2135 1 2 2024 01 01 Graph-Theoretic Analysis of de Bruijn Graphs: Fault Resilience and Fragility 63 91 105464 10.48308/jicse.2025.237255.1037 EN Farshad Safaei Faculty of Computer Science and Engineering, Shahid Beheshti University, Tehran, Iran Mohammad Mahdi Emadi Khouchak Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran 0009-0009-2572-3356 Mehrnaz Moudi Department of Computer Engineering, University of Torbat Heydarieh, Razavi Khorasan Province, IRAN 0000-0002-9081-5347 Journal Article 2024 10 15 The de Bruijn graph, initially proposed as a topological architecture for interconnection networks, offers unique attributes. These graphs are regular, Eulerian, and Hamiltonian, boasting a small diameter close to optimal connectivity. Their low average distance, small diameter, and high connectivity contribute to remarkable fault tolerance against both node and edge failures. Comprehensively, these graphs serve as pivotal components in word-representing networks, finding applications in various scientific and engineering domains, particularly in genome assembly. They play a significant role in bioinformatics, information theory, coding, communication networks, and multiprocessors. Additionally, de Bruijn graphs are utilized in peer-to-peer (P2P) networks and distributed hash tables (DHT), demonstrating their versatility. Moreover, de Bruijn graphs can serve as a robust infrastructure for modeling online/offline user behavior. In this article, we delve into the different types of de Bruijn graphs and their unique properties from a graph theory perspective. Our focus is on evaluating the reliability of these graphs concerning resilience, fragility, and vulnerability to random failures and targeted attacks on both nodes and edges. https://jicse.sbu.ac.ir/article_105464_1799f4ede88253d78a16787016b88d54.pdf