English
Related papers

Related papers: Contraction Formulas For Kirchhoff And Wiener Indi…

200 papers

The Ferrers bound conjecture is a natural graph-theoretic extension of the enumeration of spanning trees for Ferrers graphs. We document the current status of the conjecture and provide a further conjecture which implies it.

Combinatorics · Mathematics 2022-10-07 MLE Slone

Let $G$ be a a connected graph. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide asymptotic formulae for the maximum Wiener index of simple triangulations and…

Combinatorics · Mathematics 2023-06-22 Éva Czabarka , Peter Dankelmann , Trevor Olsen , László A. Székely

The first and the second Zagreb eccentricity index of a graph $G$ are defined as $E_1(G)=\sum_{v\in V(G)}\varepsilon_{G}(v)^{2}$ and $E_2(G)=\sum_{uv\in E(G)}\varepsilon_{G}(u)\varepsilon_{G}(v)$, respectively, where $\varepsilon_G(v)$ is…

Combinatorics · Mathematics 2019-12-16 Kexiang Xu , Kinkar Chandra Das , Sandi Klavžar , Huimin Li

Generalized product formulas and index transforms, involving products of Whittaker's functions of different indices are established and investigated. The corresponding inversion formulas are found. Particular cases cover index transforms…

Classical Analysis and ODEs · Mathematics 2025-06-09 Semyon Yakubovich

We give a new formula for the rotation number (or Whitney index) of a smooth closed plane curve. This formula is obtained from the winding numbers associated with the regions and the crossing points of the curve. One difference with the…

Geometric Topology · Mathematics 2020-10-06 Damián Wesenberg

For any connected multigraph $G=(V,E)$ and any $M\subseteq E$, if $M$ induces an acyclic subgraph of $G$ and removing all edges in $M$ yields a subgraph of $G$ whose components are complete graphs, a formula for $\tau_G(M)$ is obtained,…

Combinatorics · Mathematics 2019-07-18 Fengming Dong

Heydari \cite{heydari2013} presented very nice formulae for the Wiener and terminal Wiener indices of generalized Bethe trees. It is pity that there are some errors for the formulae. In this paper, we correct these errors and characterize…

Combinatorics · Mathematics 2013-05-28 Ya-Hong Chen , Xiao-Dong Zhang

Using the concept of a twisted trace density on a cyclic groupoid, a trace is constructed on a formal deformation quantization of a symplectic orbifold. An algebraic index theorem for orbifolds follows as a consequence of a local…

K-Theory and Homology · Mathematics 2007-05-23 Markus J. Pflaum , Hessel Posthuma , Xiang Tang

The Wiener polarity index of a graph G is the number of unordered pairs of vertices u, v such that the distance between u and v is 3. In this paper we give an explicit formula for the Wiener polarity index of cactus graphs. We also deduce…

Combinatorics · Mathematics 2014-09-19 Nan Chen , Wen-Xue Du , Yi-Zheng Fan

We study the graphs generated when the formula for linking Markov triples is applied to general triples of integers. We find there are a finite number of equivalence classes of graphs, each with particular properties.

General Mathematics · Mathematics 2026-02-23 Spencer Scutt , Mark Turpin

Using the stress energy tensor, we establish some monotonicity formulae for vector bundle-valued p-forms satisfying the conservation law, provided that the base Riemannian (resp. K\"ahler) manifolds poss some real (resp. complex)…

Differential Geometry · Mathematics 2012-03-27 Yuxin Dong , Hezi Lin

The Wiener index of a graph is the sum of all pairwise shortest-path distances between its vertices. In this paper we study the novel problem of finding a minimum Wiener connector: given a connected graph $G=(V,E)$ and a set $Q\subseteq V$…

Social and Information Networks · Computer Science 2016-10-18 Natali Ruchansky , Francesco Bonchi , David Garcia-Soriano , Francesco Gullo , Nicolas Kourtellis

We briefly review 3-dimensional untwisted Dijkgraaf-Witten theory over a finite group $\Gamma$, and present a method of computing untwisted Dijkgraaf-Witten invariants for arborescent links. Some explicit formulas are given when…

Geometric Topology · Mathematics 2022-07-15 Haimiao Chen

This paper presents, by example, an index theory appropriate to algebras without trace. Whilst we work exclusively with the Cuntz algebras the exposition is designed to indicate how to develop a general theory. Our main result is an index…

K-Theory and Homology · Mathematics 2008-02-29 A. L. Carey , J. Phillips , A. Rennie

Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of the similar type, called linearized Wenger graphs. The spectrum, diameter and girth of these linearized Wenger graphs are…

Combinatorics · Mathematics 2014-12-02 Xiwang Cao , Mei Lu , Daqing Wan , Li-Ping Wang , Qiang Wang

The well known formulas express the curvature and the torsion of a curve in $R^3$ in terms of euclidean invariants of its derivatives. We obtain expressions of this kind for all curvatures of curves in $R^n$. It follows that a curve in…

Differential Geometry · Mathematics 2012-12-03 Eugene Gutkin

The complexity of a graph can be obtained as a derivative of a variation of the zeta function or a partial derivative of its generalized characteristic polynomial evaluated at a point [\textit{J. Combin. Theory Ser. B}, 74 (1998), pp.…

Combinatorics · Mathematics 2010-11-01 Dongseok Kim , Young Soo Kwon , Jaeun Lee

We use a spectral theory perspective to reconsider properties of the Riemann zeta function. In particular, new integral representations are derived and used to present its value at odd positive integers.

Spectral Theory · Mathematics 2018-12-04 Mark S. Ashbaugh , Fritz Gesztesy , Lotfi Hermi , Klaus Kirsten , Lance Littlejohn , Hagop Tossounian

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…

Geometric Topology · Mathematics 2019-11-11 Jacob Mostovoy , Michael Polyak

We analyze variational inference for highly symmetric graphical models such as those arising from first-order probabilistic models. We first show that for these graphical models, the tree-reweighted variational objective lends itself to a…

Artificial Intelligence · Computer Science 2014-06-23 Hung Hai Bui , Tuyen N. Huynh , David Sontag