Introduction

Author(s):  
Vadim Zverovich

This chapter gives a brief overview of selected applications of graph theory, many of which gave rise to the development of graph theory itself. A range of such applications extends from puzzles and games to serious scientific and real-life problems, thus illustrating the diversity of applications. The first section is devoted to the six earliest applications of graph theory. The next section introduces so-called scale-free networks, which include the web graph, social and biological networks. The last section describes a number of graph-theoretic algorithms, which can be used to tackle a number of interesting applications and problems of graph theory.

Author(s):  
Vadim Zverovich

This book discusses many modern, cutting-edge applications of graph theory, such as traffic networks and Braess’ paradox, navigable networks and optimal routing for emergency response, backbone/dominating sets in wireless sensor networks, placement of electric vehicle charging stations, pedestrian safety and graph-theoretic methods in molecular epidemiology. Because of the rapid growth of research in this field, the focus of the book is on the up-to-date development of the aforementioned applications. The book will be ideal for researchers, engineers, transport planners and emergency response specialists who are interested in the recent development of graph theory applications. Moreover, this book can be used as teaching material for postgraduate students because, in addition to up-to-date descriptions of the applications, it includes exercises and their solutions. Some of the exercises mimic practical, real-life situations. Advanced students in graph theory, computer science or molecular epidemiology may use the problems and research methods presented in this book to develop their final-year projects, master’s theses or doctoral dissertations; however, to use the information effectively, special knowledge of graph theory would be required.


2019 ◽  
Vol 4 (1) ◽  
pp. 18
Author(s):  
I ketut Suastika ◽  
Vivi Suwanti

This study is investigates the college student’s errors on their graph representations making based on the mathematical connections indicators. Pilot studies were conducted with 4 college students of middle to high ability in Graph Theory class. Data analyze revealed that top 3 subject’s errors are 1) Finding the relations of a representations to it’s concepts and procedures, 2) Applying mathematics in other sciences or real life problems, and 3) Finding relations among procedures of the equivalent representations. Their lack of graph concepts understanding and it’s connections plays the major role in their errors. They failed at recognizing and choosing the suitable properties of graph which able to detect the error of their graph representation. So, in order to decrease college student errors in graph representations, we need to strengthen their basic concepts and its connections.


2018 ◽  
Vol 29 (06) ◽  
pp. 1850044 ◽  
Author(s):  
Zhichao Ju ◽  
Jinlong Ma ◽  
Jianjun Xie ◽  
Zhaohui Qi

To control the spread of cascading failure on scale-free networks, we propose a new model with the betweenness centrality and the degrees of the nodes which are combined. The effects of the parameters of the edge weight on cascading dynamics are investigated. Five metrics to evaluate the robustness of the network are given: the threshold parameter ([Formula: see text]), the proportion of collapsed edges ([Formula: see text]), the proportion of collapsed nodes ([Formula: see text]), the number of nodes in the largest connected component ([Formula: see text]) and the number of the connected component ([Formula: see text]). Compared with the degrees of nodes’ model and the betweenness of the nodes’ model, the new model could control the spread of cascading failure more significantly. This work might be helpful for preventing and mitigating cascading failure in real life, especially for small load networks.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Sami Ullah Khan ◽  
Abdul Nasir ◽  
Naeem Jan ◽  
Zhen-Hua Ma

Neutrosophic graph (NG) is a powerful tool in graph theory, which is capable of modeling many real-life problems with uncertainty due to unclear, varying, and indeterminate information. Meanwhile, the fuzzy graphs (FGs) and intuitionistic fuzzy graphs (IFGs) may not handle these problems as efficiently as NGs. It is difficult to model uncertainty due to imprecise information and vagueness in real-world scenarios. Many real-life optimization problems are modeled and solved using the well-known fuzzy graph theory. The concepts of covering, matching, and paired domination play a major role in theoretical and applied neutrosophic environments of graph theory. Henceforth, the current study covers this void by introducing the notions of covering, matching, and paired domination in single-valued neutrosophic graph (SVNG) using the strong edges. Also, many attention-grabbing properties of these concepts are studied. Moreover, the strong covering number, strong matching number, and the strong paired domination number of complete SVNG, complete single-valued neutrosophic cycle (SVNC), and complete bipartite SVNG are worked out along with their fascinating properties.


Mathematics ◽  
2019 ◽  
Vol 7 (6) ◽  
pp. 551 ◽  
Author(s):  
Liangsong Huang ◽  
Yu Hu ◽  
Yuxia Li ◽  
P. K. Kishore Kumar ◽  
Dipak Koley ◽  
...  

Fuzzy graph theory is a useful and well-known tool to model and solve many real-life optimization problems. Since real-life problems are often uncertain due to inconsistent and indeterminate information, it is very hard for an expert to model those problems using a fuzzy graph. A neutrosophic graph can deal with the uncertainty associated with the inconsistent and indeterminate information of any real-world problem, where fuzzy graphs may fail to reveal satisfactory results. The concepts of the regularity and degree of a node play a significant role in both the theory and application of graph theory in the neutrosophic environment. In this work, we describe the utility of the regular neutrosophic graph and bipartite neutrosophic graph to model an assignment problem, a road transport network, and a social network. For this purpose, we introduce the definitions of the regular neutrosophic graph, star neutrosophic graph, regular complete neutrosophic graph, complete bipartite neutrosophic graph, and regular strong neutrosophic graph. We define the d m - and t d m -degrees of a node in a regular neutrosophic graph. Depending on the degree of the node, this paper classifies the regularity of a neutrosophic graph into three types, namely d m -regular, t d m -regular, and m-highly irregular neutrosophic graphs. We present some theorems and properties of those regular neutrosophic graphs. The concept of an m-highly irregular neutrosophic graph on cycle and path graphs is also investigated in this paper. The definition of busy and free nodes in a regular neutrosophic graph is presented here. We introduce the idea of the μ -complement and h-morphism of a regular neutrosophic graph. Some properties of complement and isomorphic regular neutrosophic graphs are presented here.


2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Insoo Sohn

It is expected that Internet of Things (IoT) revolution will enable new solutions and business for consumers and entrepreneurs by connecting billions of physical world devices with varying capabilities. However, for successful realization of IoT, challenges such as heterogeneous connectivity, ubiquitous coverage, reduced network and device complexity, enhanced power savings, and enhanced resource management have to be solved. All these challenges are heavily impacted by the IoT network topology supported by massive number of connected devices. Small-world networks and scale-free networks are important complex network models with massive number of nodes and have been actively used to study the network topology of brain networks, social networks, and wireless networks. These models, also, have been applied to IoT networks to enhance synchronization, error tolerance, and more. However, due to interdisciplinary nature of the network science, with heavy emphasis on graph theory, it is not easy to study the various tools provided by complex network models. Therefore, in this paper, we attempt to introduce basic concepts of graph theory, including small-world networks and scale-free networks, and provide system models that can be easily implemented to be used as a powerful tool in solving various research problems related to IoT.


2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Zafar Ullah ◽  
Huma Bashir ◽  
Rukhshanda Anjum ◽  
Salman A. AlQahtani ◽  
Suheer Al-Hadhrami ◽  
...  

The concept of fuzzy graph (FG) and its generalized forms has been developed to cope with several real-life problems having some sort of imprecision like networking problems, decision making, shortest path problems, and so on. This paper is based on some developments in generalization of FG theory to deal with situation where imprecision is characterized by four types of membership grades. A novel concept of T-spherical fuzzy graph (TSFG) is proposed as a common generalization of FG, intuitionistic fuzzy graph (IFG), and picture fuzzy graph (PFG) based on the recently introduced concept of T-spherical fuzzy set (TSFS). The significance and novelty of proposed concept is elaborated with the help of some examples, graphical analysis, and results. Some graph theoretic terms are defined and their properties are studied. Specially, the famous Dijkstra algorithm is proposed in the environment of TSFGs and is applied to solve a shortest path problem. The comparative analysis of the proposed concept and existing theory is made. In addition, the advantages of the proposed work are discussed over the existing tools.


Author(s):  
Christian Darabos ◽  
Mario Giacobini ◽  
Marco Tomassini

Random Boolean Networks (RBN) have been introduced by Kauffman more than thirty years ago as a highly simplified model of genetic regulatory networks. This extremely simple and abstract model has been studied in detail and has been shown capable of extremely interesting dynamical behavior. First of all, as some parameters are varied such as the network’s connectivity, or the probability of expressing a gene, the RBN can go through a phase transition, going from an ordered regime to a chaotic one. Kauffman’s suggestion is that cell types correspond to attractors in the RBN phase space, and only those attractors that are short and stable under perturbations will be of biological interest. Thus, according to Kauffman, RBN lying at the edge between the ordered phase and the chaotic phase can be seen as abstract models of genetic regulatory networks. The original view of Kauffman, namely that these models may be useful for understanding real-life cell regulatory networks, is still valid, provided that the model is updated to take into account present knowledge about the topology of real gene regulatory networks, and the timing of events, without loosing its attractive simplicity. According to present data, many biological networks, including genetic regulatory networks, seem, in fact, to be of the scale-free type. From the point of view of the timing of events, standard RBN update their state synchronously. This assumption is open to discussion when dealing with biologically plausible networks. In particular, for genetic regulatory networks, this is certainly not the case: genes seem to be expressed in different parts of the network at different times, according to a strict sequence, which depends on the particular network under study. The expression of a gene depends on several transcription factors, the synthesis of which appear to be neither fully synchronous nor instantaneous. Therefore, we have recently proposed a new, more biologically plausible model. It assumes a scale-free topology of the networks and we define a suitable semi-synchronous dynamics that better captures the presence of an activation sequence of genes linked to the topological properties of the network. By simulating statistical ensembles of networks, we discuss the attractors of the dynamics, showing that they are compatible with theoretical biological network models. Moreover, the model demonstrates interesting scaling abilities as the size of the networks is increased.


2009 ◽  
Vol 20 (08) ◽  
pp. 1291-1298 ◽  
Author(s):  
JIAN-WEI WANG ◽  
LI-LI RONG

Assume the initial load of an edge ij in a network to be Lij =[(ki ∑a ∈ Γi ka)(kj ∑b ∈ Γj kb)]α with ki and kj being the degrees of the nodes connected by the edge, where α is a tunable parameter which controls the strength of the edge initial load, and Γi and Γj are the sets of neighboring nodes of i and j, respectively. We investigate the cascading phenomenon of uncorrelated scale-free networks subject to two different attacking strategies on edges, i.e. attacking on the edges with the highest loads or the lowest loads (LL). By the critical threshold of edge capacity quantifying the network robustness, we numerically discuss the effects of two attacks for the network vulnerability. Interestingly, it is found that the attack on the edge with the LL is highly effective in disrupting the structure of the attacked network when α < 0.5. In the case of α = 0.5, the effects of two attacks for the network robustness against cascading failures are almost identical. We furthermore provide the theoretical prediction support for the numerical simulations. These results may be very helpful for real-life networks to protect the key edges selected effectively to avoid cascading-failure-induced disasters.


2021 ◽  
Author(s):  
Adam A. Butchy ◽  
Cheryl A. Telmer ◽  
Natasa Miskov-Zivanov

Abstract Background: Due to the complexity and redundancy of biological systems, computational models are difficult and laborious to create and update. Therefore, machine reading and automated model assembly are of great interest to computational and systems biologists. Here, we describe FIDDLE (Finding Interactions using Diagram Driven modeL Extension), the tool that we built with the goal to automatically assemble or extend models with the knowledge extracted from published literature. The two main methods developed as part of FIDDLE are called Breadth First Addition (BFA) and Depth First Addition (DFA), and they are based on network search algorithms. To assess the advantages and limitations of BFA and DFA, we applied them on Erdös-Rényi random networks (ER) and Barabási-Albert scale-free networks (BA) as models of biological networks. Starting with several different baseline models and different sets of candidate edges, we conducted a comprehensive evaluation of the BFA and DFA algorithms and their ability to either reconstruct a specified network structure or assemble models that reproduce the same behavior as defined golden models.Results: When BFA and DFA are applied to random networks, we are able to show that model extension with BFA is more specific and DFA is a more sensitive approach. When applied to scale-free networks, both BFA and DFA demonstrated very limited success. Conclusion: Results suggest that BFA is a better method for assembling abundant but mixed true and false information, while DFA will better assemble fewer and more truthful interactions. The limited success with scale-free networks suggests a fundamental difficulty with automatically creating biological models due to the inherent redundancy and complexity of biological networks. These methods represent an early attempt and a novel approach to truly autonomous model creation or extension given different types of knowledge. The source code is available at: https://bitbucket.org/biodesignlab/fiddle/.


Sign in / Sign up

Export Citation Format

Share Document