Related papers: Contraction Formulas For Kirchhoff And Wiener Indi…
We study the graph on reduced words with edges given by the Coxeter relations for the symmetric group. We define a metric on reduced words for a given permutation, analogous to Coxeter length for permutations, for which the graph becomes…
The Wiener index of a finite graph G is the sum over all pairs (p, q) of vertices of G of the distance between p and q. When P is a finite poset, we define its Wiener index as the Wiener index of the graph of its Hasse diagram. In this…
We present a new characterization of $k$-trees based on their reduced clique graphs and $(k+1)$-line graphs, which are block graphs. We explore structural properties of these two classes, showing that the number of clique-trees of a…
In this article, we determine the maximum Wiener indices of unicyclic graphs with given number of vertices and matching number. We also characterize the extremal graphs. This solves an open problem of Du and Zhou.
An algorithm is given for computing explicit formulas for the generators of relations among the invariant rational functions for vector-valued bilinear forms. These formulas have applications in the geometry of Riemannian submanifolds and…
In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…
In this article we introduce a new type of cyclic contraction mapping on a pair of subsets of a metric space with a graph and prove best proximity points results for the same. Also, we demonstrate that the number of such points is same with…
We consider the second weighted Bartholdi zeta function of a graph $G$, and present weighted versions for the result of Li and Hou's on the partial derivatives of the determinant part in the determinant expression of the Bartholdi zeta…
An integral geometric curvature is defined as the index expectation K(x) = E[i(x)] if a probability measure m is given on vector fields on a Riemannian manifold or on a finite simple graph. Such curvatures are local, satisfy Gauss-Bonnet…
The Krein-von Neumann extension is studied for Schr\"odinger operators on metric graphs. Among other things, its vertex conditions are expressed explicitly, and its relation to other self-adjoint vertex conditions (e.g.…
We prove a substantial extension of an inverse spectral theorem of Ambarzumyan, and show that it can be applied to arbitrary compact Riemannian manifolds, compact quantum graphs and finite combinatorial graphs, subject to the imposition of…
In previous works the group inverse of a network obtained by some perturbations, as the deletion of a vertex, the addition of a new vertex, contraction of an edge, etc. is obtained in terms of the group inverse of the original network. In…
In this article, we extend Moon's classic formula for counting spanning trees in complete graphs containing a fixed spanning forest to complete bipartite graphs. Let $(X,Y)$ be the bipartition of the complete bipartite graph $K_{m,n}$ with…
We use the concept of a Kirchhoff resistor network (alternatively random walk on a network) to probe connected graphs and produce symmetry revealing canonical labelings of the graph(s) nodes and edges.
A formula is given for the Seiberg-Witten invariants of a 4-manifold that is cut along certain kinds of 3-dimensional tori. The formula involves a Seiberg-Witten invariant for each of the resulting pieces.
The contraction is applied to obtaining of integrable systems associated with nonsemisimple algebras. The effect of contraction is splitting off some components from initial system without loss of integrability.
Let $G$ be a connected graph. The resistance distance between any two vertices of $G$ is equal to the effective resistance between them in the corresponding electrical network constructed from $G$ by replacing each edge with a unit…
We present techniques for maintaining subgraph frequencies in a dynamic graph, using data structures that are parameterized in terms of h, the h-index of the graph. Our methods extend previous results of Eppstein and Spiro for maintaining…
Inversion theorems of Wiener type are essential tools in analysis and number theory. We derive a weighted version of an inversion theorem of Wiener type for general Dirichlet series from that of Edwards from 1957, and we outline an…
We show that the eccentricities, diameter, radius, and Wiener index of an undirected $n$-vertex graph with nonnegative edge lengths can be computed in time $O(n\cdot \binom{k+\lceil\log n\rceil}{k} \cdot 2^k k^2 \log n)$, where $k$ is the…