Estimating the relative importance of vertices and edges is a fundamental issue in the analysis of complex networks, and has found vast applications in various aspects, such as social networks, power grids, and biological networks. Most previous work focuses on metrics of vertex importance and methods for identifying powerful vertices, while related work for edges is much lesser, especially for...

Comparison theorems on resistance distances and Kirchhoff indices of the so-called S& T -isomer graphs are established. Then these results are applied to compare Kirchhoff indices of hexagonal chains, showing that the straight chain is the unique chain with maximum Kirchhoff index, whereas the minimum Kirchhoff index is achieved only when the hexagonal chain is an ‘‘all-kink’’ chain. © 2014 Els...

The fundamental relationship between matrices over the rational numbers and a newly defined type of graph, a Kirchhoff graph, is discussed. For a given matrix, a Kirchhoff graph for that matrix represents the orthogonal complementarity of the null and row spaces of the matrix. A number of basic results are proven, and then a relatively complicated Kirchhoff graph is constructed for a matrix tha...

We investigate the finite-time stabilization of a tree-shaped network of strings. Transparent boundary conditions are applied at all the external nodes. At any internal node, in addition to the usual continuity conditions, a modified Kirchhoff law incorporating a damping term αut with a coefficient α that may depend on the node is considered. We show that for a convenient choice of the sequence...

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...

The hyper-Kirchhoff index is introduced when the hyper-Wiener operator is applied to the resistance-distance matrix of a connected graph. We give lower and upper bounds for the hyper-Kirchhoff index, and determine the n-vertex unicyclic graphs with the smallest, the second and the third smallest as well as the largest, the second and the third largest hyper-Kirchhoff indices for n ≥ 5. We also ...

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 consider the interaction of two vortex patches (elliptic Kirchhoff vortices) which move in an unbounded volume of an ideal incompressible fluid. A moment second-order model is used to describe the interaction. The case of integrability of a Kirchhoff vortex and a point vortex by the variable separation method is qualitatively analyzed. A new case of integrability of two Kirchhoff vortices is...

Inspired by a recent result of Davies and Pushnitski, we study resonance asymptotics of quantum graphs with general coupling conditions at the vertices. We derive a criterion for the asymptotics to be of a non-Weyl character. We show that for balanced vertices with permutation-invariant couplings the asymptotics is non-Weyl only in case of Kirchhoff or anti-Kirchhoff conditions. For graphs with...