Related papers: A Whitney polynomial for hypermaps
A generalized vertex join of a graph is obtained by joining an arbitrary multiset of its vertices to a new vertex. We present a low-order polynomial time algorithm for finding the chromatic polynomials of generalized vertex joins of trees,…
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…
A Dynamic Programming based polynomial worst case time and space algorithm is described for computing Hamiltonian Path of a directed graph. Complexity constructive proofs along with a tested C++ implementation are provided as well. The…
We introduce invariants of spatial graphs related to the Wu invariant and the Simon invariant, and apply them to prove that certain graphs are intrinsically chiral, and to obtain lower bounds for the minimal crossing number of embedded…
The Dowling lattice $Q_n(\mathfrak{G})$, $\mathfrak{G}$ a finite group, generalizes the geometric lattice generated by all vectors, over a field, with at most two nonzero components. Abstractly, it is a fundamental object in the…
Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we survey some results on the…
We give a bijection between a quotient space of the parameters and the space of moments for any $A$-hypergeometric distribution. An algorithmic method to compute the inverse image of the map is proposed utilizing the holonomic gradient…
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…
In this paper, we define a homogeneous polynomial for a general hypergraph, and establish a remarkable connection between clique number and the homogeneous polynomial of a general hypergraph. For a general hypergraph, we explore some…
In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.
In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain first and second order differential equations for the orthogonal polynomials and associated functions with a weight on the unit circle. We…
We introduce a refined version of group cohomology and relate it to the space of polynomials on the group in question. We show that the polynomial cohomology with trivial coefficients admits a description in terms of ordinary cohomology…
Here, we represent a general hypergraph by a matrix and study its spectrum. We extend the definition of equitable partition and joining operation for hypergraphs, and use those to compute eigenvalues of different hypergraphs. We derive the…
In this article, we focus on the characteristic polynomial of a graph containingloops, but without multiple edges. We present a relationship between thecharacteristic polynomial of a graph with loops and the graph obtained byremoving all…
In this article we are introducing combinatorial spectra of graphs, this is a generalization of $H$-Hamiltonian spectra. The main motivation was to made from $H$-Hamiltonian spectra an operation and develop some algebra in this field. An…
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
We define, for an arbitrary partially ordered set, a multi-variable polynomial generalizing the hook polynomial.
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
The purpose of this paper is to study some properties of the Newton maps associated to real quintic polynomials. First using the Tschirnhaus transformation, we reduce the study of Newton's method for general quintic polynomials to the case…
We present an example of a result in graph theory that is used to obtain a result in another branch of mathematics. More precisely, we show that the isomorphism of certain directed graphs implies that some trinomials over finite fields have…