Graph Theory: Connectivity, Software Engineering and Bioinformatics
The author’s passion for teaching core computer science courses, particularly discrete math and algorithms, inspired this book. Graphs are crucial in solving real—world problems, and this book aims to present graph theory gradually and accessibly. It provides a comprehensive overview of foundational and advanced concepts, starting with an introduction to graph theory, types of graphs, and their significance. The book covers key terms, properties, Eulerian and Hamiltonian graphs, isomorphism, subgraphs, and special graphs such as complete and bipartite graphs.
The representation of graphs is discussed highlighting their practical applications and differences. A dedicated chapter showcases the use of graphs such as search engines, networks, and bioinformatics. Various graph algorithms are detailed, including Eulerian tours, shortest paths, minimum spanning trees, maximum flow, and matching. An appendix on algorithm complexity provides insights into analyzing algorithms, time complexity.
This book is ideal for undergraduate and graduate students in mathematics, computer science, engineering, and those interested in mathematical structures. It is also valuable for software engineers and developers interested in modeling systems.

1148756359
Graph Theory: Connectivity, Software Engineering and Bioinformatics
The author’s passion for teaching core computer science courses, particularly discrete math and algorithms, inspired this book. Graphs are crucial in solving real—world problems, and this book aims to present graph theory gradually and accessibly. It provides a comprehensive overview of foundational and advanced concepts, starting with an introduction to graph theory, types of graphs, and their significance. The book covers key terms, properties, Eulerian and Hamiltonian graphs, isomorphism, subgraphs, and special graphs such as complete and bipartite graphs.
The representation of graphs is discussed highlighting their practical applications and differences. A dedicated chapter showcases the use of graphs such as search engines, networks, and bioinformatics. Various graph algorithms are detailed, including Eulerian tours, shortest paths, minimum spanning trees, maximum flow, and matching. An appendix on algorithm complexity provides insights into analyzing algorithms, time complexity.
This book is ideal for undergraduate and graduate students in mathematics, computer science, engineering, and those interested in mathematical structures. It is also valuable for software engineers and developers interested in modeling systems.

68.99 Pre Order
Graph Theory: Connectivity, Software Engineering and Bioinformatics

Graph Theory: Connectivity, Software Engineering and Bioinformatics

by Aiman S. Gannous
Graph Theory: Connectivity, Software Engineering and Bioinformatics

Graph Theory: Connectivity, Software Engineering and Bioinformatics

by Aiman S. Gannous

Paperback

$68.99 
  • SHIP THIS ITEM
    Available for Pre-Order. This item will be released on April 8, 2026

Related collections and offers


Overview

The author’s passion for teaching core computer science courses, particularly discrete math and algorithms, inspired this book. Graphs are crucial in solving real—world problems, and this book aims to present graph theory gradually and accessibly. It provides a comprehensive overview of foundational and advanced concepts, starting with an introduction to graph theory, types of graphs, and their significance. The book covers key terms, properties, Eulerian and Hamiltonian graphs, isomorphism, subgraphs, and special graphs such as complete and bipartite graphs.
The representation of graphs is discussed highlighting their practical applications and differences. A dedicated chapter showcases the use of graphs such as search engines, networks, and bioinformatics. Various graph algorithms are detailed, including Eulerian tours, shortest paths, minimum spanning trees, maximum flow, and matching. An appendix on algorithm complexity provides insights into analyzing algorithms, time complexity.
This book is ideal for undergraduate and graduate students in mathematics, computer science, engineering, and those interested in mathematical structures. It is also valuable for software engineers and developers interested in modeling systems.


Product Details

ISBN-13: 9783119143721
Publisher: De Gruyter
Publication date: 04/08/2026
Series: De Gruyter Textbook
Pages: 168
Product dimensions: 6.69(w) x 9.45(h) x (d)

About the Author

Aiman S. Gannous is an Assistant professor at the Department of Health Informatics at the University of Benghazi, Benghazi, Libya. Dr. Gannous received his B.Sc. in Computer Science from the University of Benghazi (Garyounis) in 2001 and his M.Sc. in Computer Science and Artificial Intelligence in 2008 from the same University. Dr. Gannous received his PhD in Computer Science from the University of Denver, Denver, Colorado, in 2020. Dr. Gannous’s dissertation focused on the safety certification of safety—critical systems under the supervision of Professor Anneliese Andrews. While pursuing his PhD degree in the United States, Dr. Gannous worked as an adjunct faculty member at three different schools in Denver, Colorado: the University of Denver, Regis University, the University of Colorado Denver, and Metropolitan State University of Denver. At these universities, he taught a variety of classes both for undergraduate and graduate programs. Dr. Gannous has published numerous articles in machine learning and software testing. He is also the co—author of a book on data structures and algorithms, written in Arabic and published in 2012. Besides his work in academia, Dr. Gannous gained practical experience by working in the industry as a Data Engineer at Arrow Electronics, Englewood, Colorado, and as a Security Systems Developer at Ttec, Englewood, Colorado. In these two large—scale companies, he participated in major projects.

From the B&N Reads Blog

Customer Reviews