Nowadays, graph theory is an important analysis tool in mathematics and computer science. Because of the inherent simplicity of graph theory, it can be used to model many different physical and abstract systems such as transportation and communication networks, models for business administration, political science, and psychology and so on. The purpose of this book is not only to present the latest state and development tendencies of graph theory, but to bring the reader far enough along the way to enable him to embark on the research problems of his own. Taking into account the large amount of knowledge about graph theory and practice presented in the book, it has two major parts: theoretical researches and applications. The book is also intended for both graduate and postgraduate students in fields such as mathematics, computer science, system sciences, biology, engineering, cybernetics, and social sciences, and as a reference for software professionals and practitioners.

New Frontiers in Nanochemistry: Concepts, Theories, and Trends, Volume 2: Topological Nanochemistry is the second of the new three-volume set that explains and explores the important basic and advanced modern concepts in multidisciplinary chemistry. Under the broad expertise of the editor, this second volume explores the rich research areas of nanochemistry with a specific focus on the design and control of nanotechnology by structural and reactive topology. The objective of this particular volume is to emphasize the application of nanochemistry. With 46 entries from eminent international scientists and scholars, the content in this volume spans concepts from A-to-Z—from entries on the atom-bond connectivity index to the Zagreb indices, from connectivity to vapor phase epitaxy, and from fullerenes to topological reactivity—and much more. The definitions within the text are accompanied by brief but comprehensive explicative essays as well as figures, tables, etc., providing a holistic understanding of the concepts presented.

New Frontiers in Nanochemistry: Concepts, Theories, and Trends, 3-Volume Set explains and explores the important fundamental and advanced modern concepts from various areas of nanochemistry and, more broadly, the nanosciences. This innovative and one-of-a kind set consists of three volumes that focus on structural nanochemistry, topological nanochemistry, and sustainable nanochemistry respectively, collectively forming an explicative handbook in nanochemistry. The compilation provides a rich resource that is both thorough and accessible, encompassing the core concepts of multiple areas of nanochemistry. It also explores the content through a trans-disciplinary lens, integrating the basic and advanced modern concepts in nanochemistry with various examples, applications, issues, tools, algorithms, and even historical notes on the important people from physical, quantum, theoretical, mathematical, and even biological chemistry.

In this work we plan to revise the main techniques for enumeration algorithms and to show four examples of enumeration algorithms that can be applied to efficiently deal with some biological problems modelled by using biological networks: enumerating central and peripheral nodes of a network, enumerating stories, enumerating paths or cycles, and enumerating bubbles. Notice that the corresponding computational problems we define are of more general interest and our results hold in the case of arbitrary graphs. Enumerating all the most and less central vertices in a network according to their eccentricity is an example of an enumeration problem whose solutions are polynomial and can be listed in polynomial time, very often in linear or almost linear time in practice. Enumerating stories, i.e. all maximal directed acyclic subgraphs of a graph G whose sources and targets belong to a predefined subset of the vertices, is on the other hand an example of an enumeration problem with an exponential number of solutions, that can be solved by using a non trivial brute-force approach. Given a metabolic network, each individual story should explain how some interesting metabolites are derived from some others through a chain of reactions, by keeping all alternative pathways between sources and targets. Enumerating cycles or paths in an undirected graph, such as a protein-protein interaction undirected network, is an example of an enumeration problem in which all the solutions can be listed through an optimal algorithm, i.e. the time required to list all the solutions is dominated by the time to read the graph plus the time required to print all of them. By extending this result to directed graphs, it would be possible to deal more efficiently with feedback loops and signed paths analysis in signed or interaction directed graphs, such as gene regulatory networks. Finally, enumerating mouths or bubbles with a source s in a directed graph, that is enumerating all the two vertex-disjoint directed paths between the source s and all the possible targets, is an example of an enumeration problem in which all the solutions can be listed through a linear delay algorithm, meaning that the delay between any two consecutive solutions is linear, by turning the problem into a constrained cycle enumeration problem. Such patterns, in a de Bruijn graph representation of the reads obtained by sequencing, are related to polymorphisms in DNA- or RNA-seq data.

Nowadays, graph theory is an important analysis tool in mathematics and computer science. Because of the inherent simplicity of graph theory, it can be used to model many different physical and abstract systems such as transportation and communication networks, models for business administration, political science, and psychology and so on. The purpose of this book is not only to present the latest state and development tendencies of graph theory, but to bring the reader far enough along the way to enable him to embark on the research problems of his own. Taking into account the large amount of knowledge about graph theory and practice presented in the book, it has two major parts: theoretical researches and applications. The book is also intended for both graduate and postgraduate students in fields such as mathematics, computer science, system sciences, biology, engineering, cybernetics, and social sciences, and as a reference for software professionals and practitioners.

Graph Theory is a branch of discrete mathematics. It has many applications to many different areas of Science and Engineering. This book provides the most up-to-date research findings and applications in Graph Theory. This book focuses on the latest research in Graph Theory. It provides recent findings that are occurring in the field, offers insights on an international and transnational levels, identifies the gaps in the results, and includes forthcoming international studies and research, along with its applications in Networking, Computer Science, Chemistry, and Biological Sciences, etc. The book is written with researchers and post graduate students in mind.