Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Network Resilience Through Graph Theory

Network Resilience Through Graph Theory

K, Priya
V, Anil Kumar

Paperback

General Mathematics

ISBN10: 620849298X
ISBN13: 9786208492984
Publisher: LAP Lambert Academic Publishing
Published: Oct 9 2025
Pages: 168
Weight: 0.51
Height: 0.39 Width: 6.00 Depth: 9.00
Language: English
In an era where network reliability is paramount, this work introduces a novel approach to fault-tolerant system design through the lens of graph theory. The book presents the innovative concept of closely-connected vertices, a powerful framework that revolutionizes our understanding of network resilience and fault tolerance. Through meticulous analysis of cc-domination, graph polynomials, and entropy measures, readers will discover new methodologies for designing robust networks that minimize link failures. This comprehensive study bridges theoretical mathematics and practical applications, offering fresh perspectives on network stability and communication overlap. Perfect for researchers, network designers, and graduate students in computer science and mathematics, this volume provides both theoretical foundations and practical insights into creating more reliable distributed systems. The work includes detailed explorations of cc-dominating sets, vertex connectivity polynomials, and their applications in real-world network analysis, making it an invaluable resource for anyone working at the intersection of graph theory and network reliability.

Also from

K, Priya

View All

Also in

General Mathematics

View All