Related papers: The Wiener polynomial of a graph
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…
Counting the number of isomers of a chemical molecule is one of the formative problems of graph theory. However, recent progress has been slow, and the problem has largely been ignored in modern network science. Here we provide an…
We find a simple product formula for the characteristic polynomial of the permutations with a fixed descent set under the weak order. As a corollary we obtain a simple product formula for the characteristic polynomial of alternating…
In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…
The arithmetic-geometric index is a newly proposed degree-based graph invariant in mathematical chemistry. We give a sharp upper bound on the value of this invariant for connected chemical graphs of given order and size and characterize the…
Diagrams as a graphic expresion of derivatives is proposed for calculation of derivatives for composed function. The concret diagram is understood as a virtual derivative in contrast of concret derivative. In polynomial expression of…
It is well-known that the symmetry group of a Feynman diagram can give important information on possible strategies for its evaluation, and the mathematical objects that will be involved. Motivated by ongoing work on multi-loop multi-photon…
Motivated by the recently introduced topological index, the Somber index, we define a new topological index of a graph in this paper, we call it Sombor coindex. The Sombor coindex is defined by considering analogous contributions from the…
Previously, the graph permanent was introduced as a single-valued invariant for graphs $G$ with $|E(G)| = k(|V(G)|-1)$ for some $k \in \mathbb{Z}_{>0}$. Herein, we construct the extended graph permanent, an infinite sequence for all graphs.…
We consider here a particular quadratic equation linking two elements of a C-Algebra. By analysing powers of the unknowns, it appears a double sequence of polynomials related to classical Bernoulli polynomials. We get the generating…
Following a general method proposed earlier, we construct here Wigner functions defined on coadjoint orbits of a class of semidirect product groups. The groups in question are such that their unitary duals consist purely of representations…
The M-polynomial provides a unifying framework for a wide class of degree-based topological indices. Despite its structural importance, general methods for computing the M-polynomial under graph constructions remain limited. In this paper,…
We define and study a bigraded knot invariant whose Euler characteristic is the Alexander polynomial, closely connected to knot Floer homology. The invariant is the homology of a chain complex whose generators correspond to Kauffman states…
The Zykov ring of signed finite simple graphs with topological join as addition and compatible multiplication is an integral domain but not a unique factorization domain. We know that because by taking graph complements, it becomes…
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.
By using definition of Golden derivative, corresponding Golden exponential function and Fibonomial coefficients, we introduce generating functions for Bernoulli-Fibonacci polynomials and related numbers. Properties of these polynomials and…
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…
The power graph $\mathscr{P}(G)$ of a group $G$ is defined as the simple graph with vertex set $G$, and where two distinct vertices $x$ and $y$ are joined by an edge if and only if either $x= y^k$ or $y= x^k$, $k \in \mathbb{N}$. Here we…
Indices of singular points of a vector field or of a 1-form on a smooth manifold are closely related with the Euler characteristic through the classical Poincar\'e--Hopf theorem. Generalized Euler characteristics (additive topological…
We construct a state model for the two-variable Kauffman polynomial using planar trivalent graphs. We also use this model to obtain a polynomial invariant for a certain type of trivalent graphs embedded in three-dimensional space.