English
Related papers

Related papers: The Wiener polynomial of a graph

200 papers

For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…

Quantum Algebra · Mathematics 2007-05-23 Laure Helme-Guizon , Yongwu Rong

The canonical polynomial is an important output of the multivariable topological Poincar\'e series associated with a normal surface singularity. It can be considered as a multivariable polynomial generalization of the Seiberg--Witten…

Geometric Topology · Mathematics 2024-10-18 Tamás László

We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\mathbf{k}})$ indexed by a multivariate parameter $\mathbf{k}=(k_1,\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate…

Combinatorics · Mathematics 2013-08-20 Delia Garijo , Andrew Goodall , Jaroslav Nesetril

Derivative polynomials in two variables are defined by repeated differentiation of the tangent and secant functions. We establish the connections between the coefficients of these derivative polynomials and the numbers of interior and left…

Combinatorics · Mathematics 2011-11-28 Shi-Mei Ma

The generating function that records the sizes of directed circuit partitions of a connected 2-in, 2-out digraph D can be determined from the interlacement graph of D with respect to a directed Euler circuit; the same is true of the…

Combinatorics · Mathematics 2012-09-24 Lorenzo Traldi

{\small The Wiener index $W(G)$ of a graph $G$ is the sum of the distances between all pairs of vertices in the graph. The Szeged index $Sz(G)$ of a graph $G$ is defined as $Sz(G)=\sum_{e=uv \in E}n_u(e)n_v(e)$ where $n_u(e)$ and $n_v(e)$…

Combinatorics · Mathematics 2012-10-25 Lily Chen , Xueliang Li , Mengmeng Liu

We define a $q$-deformation of the classical ring of integer-valued polynomials which we call the ring of quantum integer-valued polynomials. We show that this ring has a remarkable combinatorial structure and enjoys many positivity…

Rings and Algebras · Mathematics 2019-12-24 Nate Harman , Sam Hopkins

In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of closely related graph polynomials. We explore some of the Tutte polynomial's many properties and applications and we use the Tutte polynomial to…

Combinatorics · Mathematics 2008-06-28 Joanna Ellis-Monaghan , Criel Merino

A formula based on a vertex contributions of the Steiner $k$-Wiener index is induced by a newly introduced $k$-Steiner betweenness centrality, which measures the number of $k$-Steiner trees that include a particular vertex as a non-terminal…

Combinatorics · Mathematics 2016-05-11 Matjaž Kovše

The Wigner function, which provides a phase-space description of quantum systems, has various applications in quantum mechanics, quantum kinetic theory, quantum optics, radiation transport and others. The concept of Wigner function has been…

High Energy Physics - Theory · Physics 2013-04-05 Stanislaw Mrowczynski

We use a 1-parameter version of gauge theory to investigate the topology of the diffeomorphism group of 4-manifolds. A polynomial invariant, analogous to the Donaldson polynomial, is defined, and is used to show that the diffeomorphism…

Geometric Topology · Mathematics 2009-09-25 Daniel Ruberman

The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every maximal independent set has size $n/2$. Levit and Mandrescu…

Combinatorics · Mathematics 2017-09-26 Jason I. Brown , Ben Cameron

The integral of the Wigner function of a quantum mechanical system over a region or its boundary in the classical phase plane, is called a quasiprobability integral. Unlike a true probability integral, its value may lie outside the interval…

Quantum Physics · Physics 2009-11-10 A. J. Bracken , D. Ellinas , J. G. Wood

We prove a general Bismut's formula for the gradient of a class of smooth Wiener functionals over vector bundles of a compact Riemannian manifold. This general formula can be used repeatedly for obtaining probabilistic representation of…

Probability · Mathematics 2016-01-12 Elton P. Hsu , Zhenan Wang

For a given length and a given degree and an arbitrary partition of the positive integers, there always is a cell containing a polynomial progression of that length and that degree; moreover, the coefficients of the generating polynomial…

Combinatorics · Mathematics 2007-05-23 Rudi Hirschfeld

The aim of this paper is to obtain new inequalities for a large family of generalizations of the Wiener Index and to characterize the set of extremal graphs with respect to them. Our main results provide upper and lower bounds for these…

Combinatorics · Mathematics 2022-01-17 Álvaro Martínez-Pérez , osé M. Rodríguez

An invariant of a model of genus one curve is a polynomial in the coefficients of the model that is stable under certain linear transformations. The classical example of an invariant is the discriminant, which characterizes the singularity…

Number Theory · Mathematics 2020-09-14 Manh Hung Tran

We customize the existing models for the bounded derived category of gentle algebras to obtain simple graph theoretic tools to analyze indecomposable objects, Auslander-Reiten triangles, and their interaction with the associated homological…

Representation Theory · Mathematics 2025-02-05 Jesús Arturo Jiménez González , Andrzej Mróz

We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…

Combinatorics · Mathematics 2013-09-17 Tomer Kotek , Johann A. Makowsky

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

Combinatorics · Mathematics 2024-06-25 Graham Farr , Kerri Morgan