Eccentric connectivity index

The eccentric connectivity index $\xi^c$ is a novel distance--based molecular structure descriptor that was recently used for mathematical modeling of biological activities of diverse nature. It is defined as $\xi^c (G) = \sum_{v \in V (G)} deg (v) \cdot \epsilon (v)$\,, where $deg (v)$ and $\epsilon (v)$ denote the vertex degree and eccentricity of $v$\,, respectively. We survey some mathematical properties of this index and furthermore support the use of eccentric connectivity index as topological structure descriptor. We present the extremal trees and unicyclic graphs with maximum and minimum eccentric connectivity index subject to the certain graph constraints. Sharp lower and asymptotic upper bound for all graphs are given and various connections with other important graph invariants are established. In addition, we present explicit formulae for the values of eccentric connectivity index for several families of composite graphs and designed a linear algorithm for calculating the eccentric connectivity index of trees. Some open problems and related indices for further study are also listed.Comment: 25 pages, 5 figure

On the extremal properties of the average eccentricity

The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity $ecc (G)$ of a graph $G$ is the mean value of eccentricities of all vertices of $G$. The average eccentricity is deeply connected with a topological descriptor called the eccentric connectivity index, defined as a sum of products of vertex degrees and eccentricities. In this paper we analyze extremal properties of the average eccentricity, introducing two graph transformations that increase or decrease $ecc (G)$. Furthermore, we resolve four conjectures, obtained by the system AutoGraphiX, about the average eccentricity and other graph parameters (the clique number, the Randi\' c index and the independence number), refute one AutoGraphiX conjecture about the average eccentricity and the minimum vertex degree and correct one AutoGraphiX conjecture about the domination number.Comment: 15 pages, 3 figure

Structural transition in interdependent networks with regular interconnections

Networks are often made up of several layers that exhibit diverse degrees of interdependencies. A multilayer interdependent network consists of a set of graphs $G$ that are interconnected through a weighted interconnection matrix $B$, where the weight of each inter-graph link is a non-negative real number $p$. Various dynamical processes, such as synchronization, cascading failures in power grids, and diffusion processes, are described by the Laplacian matrix $Q$ characterizing the whole system. For the case in which the multilayer graph is a multiplex, where the number of nodes in each layer is the same and the interconnection matrix $B=pI$, being $I$ the identity matrix, it has been shown that there exists a structural transition at some critical coupling, $p^*$. This transition is such that dynamical processes are separated into two regimes: if $p > p^*$, the network acts as a whole; whereas when $p<p^*$, the network operates as if the graphs encoding the layers were isolated. In this paper, we extend and generalize the structural transition threshold $p^*$ to a regular interconnection matrix $B$ (constant row and column sum). Specifically, we provide upper and lower bounds for the transition threshold $p^*$ in interdependent networks with a regular interconnection matrix $B$ and derive the exact transition threshold for special scenarios using the formalism of quotient graphs. Additionally, we discuss the physical meaning of the transition threshold $p^*$ in terms of the minimum cut and show, through a counter-example, that the structural transition does not always exist. Our results are one step forward on the characterization of more realistic multilayer networks and might be relevant for systems that deviate from the topological constrains imposed by multiplex networks.Comment: 13 pages, APS format. Submitted for publicatio