The need to build a link between the structure of a complex network and the dynamical properties of the corresponding complex system (comprised of multiple low dimensional systems) has recently become apparent. Several attempts to tackle this problem have been made and all focus on either the controllability or synchronisability of the network — usually analyzed by way of the master stability f...

A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, some necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues are given. And the trees and unicyclic graphs with exactly two main signless L...

In this paper we derive a compact mathematical formulation describing the dynamics of chemical reaction networks that are complex-balanced and are governed by mass action kinetics. The formulation is based on the graph of (substrate and product) complexes and the stoichiometric information of these complexes, and crucially uses a balanced weighted Laplacian matrix. It is shown that this formula...

Determining the relative importance of nodes in directed networks is important in, for example, ranking websites, publications, and sports teams, and for understanding signal flows in systems biology. A prevailing centrality measure in this respect is the PageRank. In this work, we focus on another class of centrality derived from the Laplacian of the network. We extend the Laplacian-based cent...

The brain is a complex network of neural interactions, both at the microscopic and macroscopic level. Graph theory is well suited to examine the global network architecture of these neural networks. Many popular graph metrics, however, encode average properties of individual network elements. Complementing these "conventional" graph metrics, the eigenvalue spectrum of the normalized Laplacian d...

‎By considering a degenerate $p(x)-$Laplacian equation‎, ‎a generalized compact embedding in weighted variable‎ ‎exponent Sobolev space is presented‎. ‎Multiplicity of positive solutions are discussed by applying fibering map approach for the‎ ‎corresponding Nehari manifold‎. 

Matrices associated with graphs, such as the Laplacian, lead to numerous interesting graph problems expressed as linear systems. One field where Laplacian linear systems play a role is network analysis, e. g. for certain centrality measures that indicate if a node (or an edge) is important in the network. One such centrality measure is current-flow closeness. To allow network analysis workflows...

This work concerns the study of existence and uniqueness to heat equation with fractional Laplacian dierentiation in extended Colombeau algebra.

Recently, we have used the symmetric bracket of vector fields, and developed the notion of the symmetric derivation. Using this machinery, we have defined the concept of symmetric curvature. This concept is natural and is related to the notions divergence and Laplacian of vector fields. This concept is also related to the derivations on the algebra of symmetric forms which has been discu...

The n-tuple of Laplacian characteristic values of a graph is majorized by the conjugate sequence of its degrees. Using that result we find a collection of general inequalities for a number of Laplacian indices expressed in terms of the conjugate degrees, and then with a maximality argument, we find tight general bounds expressed in terms of the size of the vertex set n and the average degree dG...