Modelling of a WDM Network Using Graph Theory and Dijkstra Algorithm for Traffic Redirection

Optical transport networks are now the basic infrastructure of modern communications systems, including the SDH and WDM backbone network of local network operators, in the case of Cameroon. Given the colossal investments required to deploy these networks, particularly related to the cost of equipment (optical fibers, transponders and multiplexers), the optimization of bandwidth and dynamic allocation of resources is essential to control operating costs and ensure continuity of service. Automatic switching technology for optical networks brings intelligence to the control plane to fully facilitate bandwidth utilization, traffic redirection, and automatic configuration of end-to-end services. This paper considers a local network operator’s WDM network without the implementation of the automatic switching technology, develops a network modeling software platform called Graphic Networks and using graph theory integrates a particularity of the automatic switching technology, which is the automatic rerouting of traffic in case of incident in the network. The incidents considered here are those links or route failures and node failures.

Regional differences in gully network connectivity based on graph theory:a case study on the Loess Plateau,China

Material exchange frequently occurs in gullies,and thus the relationship between a gullynetwork structure and sediment transport potential has attracted considerable interest.However,previous researches ignored the difficulty of material transport from sources to sinks,and did not quantify the connectivity of a network structure.In this study,we used a graph model structure to model gully networks of six typical sample areas in the Loess Plateau of China and quantified gully network connectivity using four indexes:average node strength,accessibility from sources to sinks,potential flow,and network structural connectivity index.Results show that:(1)Reflected by different quantitative indexes,the trends of gully network connectivity in different regions are similar.From north to south,the connectivity of a sample area first increases and then decreases.(2)The more mature gullies have stronger network connectivity.Small resistance is conducive to material transport in the gullies.(3)The node connectivity index of the gully network shows a significant aggregation distribution in space,and node connectivity on the main channel is often stronger than that on the branch trench.These results not only deepen the understanding of the process and mechanism of loess gully geomorphic development and evolution but also provide a reference for geomorphic studies.

Identifying multiple influential spreaders in complex networks based on spectral graph theory

One of the hot research topics in propagation dynamics is identifying a set of critical nodes that can influence maximization in a complex network.The importance and dispersion of critical nodes among them are both vital factors that can influence maximization.We therefore propose a multiple influential spreaders identification algorithm based on spectral graph theory.This algorithm first quantifies the role played by the local structure of nodes in the propagation process,then classifies the nodes based on the eigenvectors of the Laplace matrix,and finally selects a set of critical nodes by the constraint that nodes in the same class are not adjacent to each other while different classes of nodes can be adjacent to each other.Experimental results on real and synthetic networks show that our algorithm outperforms the state-of-the-art and classical algorithms in the SIR model.

A Graph Theory Based Self-Learning Honeypot to Detect Persistent Threats

Attacks on the cyber space is getting exponential in recent times.Illegal penetrations and breaches are real threats to the individuals and organizations.Conventional security systems are good enough to detect the known threats but when it comes to Advanced Persistent Threats(APTs)they fails.These APTs are targeted,more sophisticated and very persistent and incorporates lot of evasive techniques to bypass the existing defenses.Hence,there is a need for an effective defense system that can achieve a complete reliance of security.To address the above-mentioned issues,this paper proposes a novel honeypot system that tracks the anonymous behavior of the APT threats.The key idea of honeypot leverages the concepts of graph theory to detect such targeted attacks.The proposed honey-pot is self-realizing,strategic assisted which withholds the APTs actionable tech-niques and observes the behavior for analysis and modelling.The proposed graph theory based self learning honeypot using the resultsγ(C(n,1)),γc(C(n,1)),γsc(C(n,1))outperforms traditional techniques by detecting APTs behavioral with detection rate of 96%.

A Value for Games Defined on Graphs

Given a graph g=( V,A ) , we define a space of subgraphs M with the binary operation of union and the unique decomposition property into blocks. This space allows us to discuss a notion of minimal subgraphs (minimal coalitions) that are of interest for the game. Additionally, a partition of the game is defined in terms of the gain of each block, and subsequently, a solution to the game is defined based on distributing to each player (node and edge) present in each block a payment proportional to their contribution to the coalition.

Algorithm for Visualization of Zero Divisor Graphs of the Ring ℤn Using MAPLE Coding

This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤn modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study of ring theory, depict relationships between elements of a ring that multiply to zero. The paper explores the development and implementation of algorithms in MAPLE for constructing these ZDGs. The comparative study aims to discern the strengths, limitations, and computational efficiency of different MAPLE algorithms for creating zero divisor graphs offering insights for mathematicians, researchers, and computational enthusiasts involved in ring theory and mathematical computations.

Multi-Body Dynamics Modeling and Simulation Analysis of a Vehicle Suspension Based on Graph Theory

Multi-body dynamics,relative coordinates and graph theory are combined to analyze the structure of a vehicle suspension.The dynamic equations of the left front suspension system are derived for modeling.First,The pure tire theory model is used as the input criteria of the suspension multibody system dynamic model in order to simulate the suspension K&C characteristics test.Then,it is important to verify the accuracy of this model by comparing and analyzing the experimental data and simulation results.The results show that the model has high precision and can predict the performance of the vehicle.It also provides a new solution for the vehicle dynamic modeling.

Effect of graph generation on slope stability analysis based on graph theory

Limit equilibrium method （LEM） and strength reduction method （SRM） are the most widely used methods for slope stability analysis. However, it can be noted that they both have some limitations in practical application. In the LEM, the constitutive model cannot be considered and many assumptions are needed between slices of soil/rock. The SRM requires iterative calculations and does not give the slip surface directly. A method for slope stability analysis based on the graph theory is recently developed to directly calculate the minimum safety factor and potential critical slip surface according to the stress results of numerical simulation. The method is based on current stress state and can overcome the disadvantages mentioned above in the two traditional methods. The influences of edge generation and mesh geometry on the position of slip surface and the safety factor of slope are studied, in which a new method for edge generation is proposed, and reasonable mesh size is suggested. The results of benchmark examples and a rock slope show good accuracy and efficiency of the presented method.

A graph theory model using human nature structure

A graph theory model of the human nature structure( GMH) for machine vision and image/graphics processing is described in this paper. Independent from the motion and deformation of contours,the human nature structure( HNS) embodies the most basic movement characteristics of the body. The human body can be divided into basic units like head,torso,and limbs. Using these basic units,a graph theory model for the HNS can be constructed. GMH provides a basic model for human posture processing,and the outline in the perspective projection plane is the body contour of an image. In addition,the GMH can be applied to articulated motion and deformable objects,e. g.,in the design and analysis of body posture,by modifying mapping parameters of the GMH.

Graph Theory and Matrix Approach(GTMA)Model for the Selec­tion of the Femoral-Component of Total Knee Joint Replacement

Total Knee Replacement(TKR)is the increasing trend now a day,in revision surgery which is associated with aseptic loosening,which is a challenging research for the TKR component.The selection of optimal material loosening can be controlled at some limits.This paper is going to consider the best material selected among a number of alternative materials for the femoral component(FC)by using Graph Theory.Here GTMA process used for optimization of material and a systematic technique introduced through sensitivity analysis to find out the more reliable result.Obtained ranking suggests the use of optimized material over the other existing material.By following GTMA Co_Cr-alloys(wrought-Co-Ni-Cr-Mo)and Co_Cr-alloys(cast-able-Co-Cr-Mo)are on the 1st and 2nd position respectively.

Structural and functional connectivity of the whole brain and subnetworks in individuals with mild traumatic brain injury:predictors of patient prognosis

Patients with mild traumatic brain injury have a diverse clinical presentation,and the underlying pathophysiology remains poorly understood.Magnetic resonance imaging is a non-invasive technique that has been widely utilized to investigate neuro biological markers after mild traumatic brain injury.This approach has emerged as a promising tool for investigating the pathogenesis of mild traumatic brain injury.G raph theory is a quantitative method of analyzing complex networks that has been widely used to study changes in brain structure and function.However,most previous mild traumatic brain injury studies using graph theory have focused on specific populations,with limited exploration of simultaneous abnormalities in structural and functional connectivity.Given that mild traumatic brain injury is the most common type of traumatic brain injury encounte red in clinical practice,further investigation of the patient characteristics and evolution of structural and functional connectivity is critical.In the present study,we explored whether abnormal structural and functional connectivity in the acute phase could serve as indicators of longitudinal changes in imaging data and cognitive function in patients with mild traumatic brain injury.In this longitudinal study,we enrolled 46 patients with mild traumatic brain injury who were assessed within 2 wee ks of injury,as well as 36 healthy controls.Resting-state functional magnetic resonance imaging and diffusion-weighted imaging data were acquired for graph theoretical network analysis.In the acute phase,patients with mild traumatic brain injury demonstrated reduced structural connectivity in the dorsal attention network.More than 3 months of followup data revealed signs of recovery in structural and functional connectivity,as well as cognitive function,in 22 out of the 46 patients.Furthermore,better cognitive function was associated with more efficient networks.Finally,our data indicated that small-worldness in the acute stage could serve as a predictor of longitudinal changes in connectivity in patients with mild traumatic brain injury.These findings highlight the importance of integrating structural and functional connectivity in unde rstanding the occurrence and evolution of mild traumatic brain injury.Additionally,exploratory analysis based on subnetworks could serve a predictive function in the prognosis of patients with mild traumatic brain injury.

Dynamics of Advantageous Mutant Spread in Spatial Death-Birth and Birth-Death Moran Models

The spread of an advantageous mutation through a population is of fundamental interest in population genetics. While the classical Moran model is formulated for a well-mixed population, it has long been recognized that in real-world applications, the population usually has an explicit spatial structure which can significantly influence the dynamics. In the context of cancer initiation in epithelial tissue, several recent works have analyzed the dynamics of advantageous mutant spread on integer lattices, using the biased voter model from particle systems theory. In this spatial version of the Moran model, individuals first reproduce according to their fitness and then replace a neighboring individual. From a biological standpoint, the opposite dynamics, where individuals first die and are then replaced by a neighboring individual according to its fitness, are equally relevant. Here, we investigate this death-birth analogue of the biased voter model. We construct the process mathematically, derive the associated dual process, establish bounds on the survival probability of a single mutant, and prove that the process has an asymptotic shape. We also briefly discuss alternative birth-death and death-birth dynamics, depending on how the mutant fitness advantage affects the dynamics. We show that birth-death and death-birth formulations of the biased voter model are equivalent when fitness affects the former event of each update of the model, whereas the birth-death model is fundamentally different from the death-birth model when fitness affects the latter event.

RECURSIVE FORMULA FOR CALCULATING THE CHROMATIC POLYNOMIAL OF A GRAPH BY VERTEX DELETION

A new recursive vertex-deleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for further studying chromatic polynomials but also the fastest among all the algorithms for the computation of chromatic polynomials.

How graph features decipher the soot assisted pigmental energy transport in leaves?A laser-assisted thermal lens study in nanobiophotonics

The paper employs the principles of graph theory in nanobiophotonics, where the soot-assisted intra-pigmental energy transport in leaves is unveiled through the laser-induced thermal lens(TL) technique. Nanofluids with different soot concentrations are sprayed over Lablab purpureus(L) sweet leaves, and the extracted pigments are analyzed. The graph features of the constructed complex network from the TL signal of the samples are analyzed to understand their variations with optical absorbance. Besides revealing the presence of optimum soot concentration that can enhance photosynthesis,the study brings out the potential application of graph features in nanobiophotonics.

Vertex Cover Optimization Using a Novel Graph Decomposition Approach

The minimum vertex cover problem(MVCP)is a well-known combinatorial optimization problem of graph theory.The MVCP is an NP(nondeterministic polynomial)complete problem and it has an exponential growing complexity with respect to the size of a graph.No algorithm exits till date that can exactly solve the problem in a deterministic polynomial time scale.However,several algorithms are proposed that solve the problem approximately in a short polynomial time scale.Such algorithms are useful for large size graphs,for which exact solution of MVCP is impossible with current computational resources.The MVCP has a wide range of applications in the fields like bioinformatics,biochemistry,circuit design,electrical engineering,data aggregation,networking,internet traffic monitoring,pattern recognition,marketing and franchising etc.This work aims to solve the MVCP approximately by a novel graph decomposition approach.The decomposition of the graph yields a subgraph that contains edges shared by triangular edge structures.A subgraph is covered to yield a subgraph that forms one or more Hamiltonian cycles or paths.In order to reduce complexity of the algorithm a new strategy is also proposed.The reduction strategy can be used for any algorithm solving MVCP.Based on the graph decomposition and the reduction strategy,two algorithms are formulated to approximately solve the MVCP.These algorithms are tested using well known standard benchmark graphs.The key feature of the results is a good approximate error ratio and improvement in optimum vertex cover values for few graphs.

Calculation of the Water Distribution Networks Based on the Theory of Slow Transient Flow

Urban water supply network is a modern urban survival and development of the infrastructure of a city,and its normal running conditions have important significance. The actual hydraulic process in the variableload water distribution networks can be treated as the slow transient flow which belongs to the unsteady flow. This paper analyzes the multi-loops network slow transient model based on graph theory,and the link flow matrix is treated as the variables of the discrete solution model to simulate the process of the slow transient flow in the network. With the simulation of hydraulic regime in an actual pipe network,the changing laws of the flow in the pipes,nodal hydraulic heads and other hydraulic factors with the passage of time are obtained. Since the transient processes offer much more information than a steady process,the slow transient theory is not only practical on analyzing the hydraulic condition of the network,but also on identifying hydraulic resistance coefficients of pipes and detecting the leakage in networks.

On the Number of Cycles in a Graph

In this paper, we obtain explicit formulae for the number of 7-cycles and the total number of cycles of lengths 6 and 7 which contain a specific vertex vi in a simple graph G, in terms of the adjacency matrix and with the help of combinatorics.

A Dynamic Programming Approach for the Max-Min Cycle Packing Problem in Even Graphs

Let be an undirected graph. The maximum cycle packing problem in G then is to find a collection of edge-disjoint cycles Ciin G such that s is maximum. In general, the maximum cycle packing problem is NP-hard. In this paper, it is shown for even graphs that if such a collection satisfies the condition that it minimizes the quantityon the set of all edge-disjoint cycle collections, then it is a maximum cycle packing. The paper shows that the determination of such a packing can be solved by a dynamic programming approach. For its solution, an-shortest path procedure on an appropriate acyclic networkis presented. It uses a particular monotonous node potential.

An interactive approach for generating spatial architecture layout based on graph theory

This study proposes a graph theory based method for generating three-dimensional architectural layouts on the target of creating space that provides rich perceptual experience.The proposed approach incorporates the decisions of architects in the generation process to improve efficiency and avoid invalid results.Space is interpreted as a combination of volumes adjacent to,intersecting with or containing each other and is represented by a graph with nodes and edges.The study first generates an orthogonal orientation digraph(OODG),which denotes the relative positions of spaces and provides options for users to decide whether to continue generating the layout.Based on a given OODG,a combination of connected volumes is generated.The generation results show that the proposed method can generate space providing a rich experience when relations between volumes are properly set.

A Map Coloring Method

Different vertices are colored in a plan. Adjacent vertices are colored dif-ferently from nonadjacent vertices, which are colored the same color. One color is used for a single point, two colors are used for points without a loop, and a maximum of four colors are used for points with a loop. A maximum of four colors are used to color all points. .