Gaussian network model (GNM) is one of the most accurate and efficient methods for biomolecular flexibility analysis. However, the systematic generalization of the GNM has been elusive. We show that the GNM Kirchhoff matrix can be built from the ideal low-pass filter, which is a special case of a wide class of correlation functions underpinning the linear scaling flexibility-rigidity index (FRI...

We explore the geometry of complex networks in terms of an n-dimensional Euclidean embedding represented by the Moore-Penrose pseudo-inverse of the graph Laplacian (L). The squared distance of a node i to the origin in this n-dimensional space (l ii ), yields a topological centrality index, defined as C (i) = 1/l ii . In turn, the sum of reciprocals of individual node centralities, ∑ i 1/C (i) ...

The acoustic backscatter from pressure release prolate spheroids and a three-dimensional representation of a fish swimbladder (Chilean jack mackerel, Trachurus symmetricus murphyi) was calculated using four target strength models (Kirchhoff-approximation, Kirchhoff-ray-mode, finite element solution of the Helmholtz equation, and prolate-spheroid-modal-series). Smoothly varying errors were found...

We provide a physical interpretation of the Kirchhoff index of any molecules as well as of the Wiener index of acyclic ones. For the purpose, we use a local vertex invariant that is obtained from first principles and describes the atomic displacements due to small vibrations/oscillations of atoms from their equilibrium positions. In addition, we show that the topological atomic displacements co...

The eigenvalues of the normalized Laplacian of a graph provide information on its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks. In this paper we determine the spectra of the normalized Laplacian of iterated triangulations of a generic simple connected graph. As an application, we also find closed-forms for their...

Abstract: We compare two mathematical theories that address duality between cycles and vertex-cuts of graphs in geometric settings. First, we propose a rigorous definition of a new type of graph, vector graphs. The special case of R2-vector graphs matches the intuitive notion of drawing graphs with edges taken as vectors. This leads to a discussion of Kirchhoff graphs, as originally presented b...

We introduce recursive corona graphs as a model of small-world networks. We investigate analytically the critical characteristics of the model, including order and size, degree distribution, average path length, clustering coefficient, and the number of spanning trees, as well as Kirchhoff index. Furthermore, we study the spectra for the adjacency matrix and the Laplacian matrix for the model. ...