Related papers: On polynomial digraphs
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…
Given a 0-1 square matrix A, when can some of the 1's be changed to -1's in such a way that the permanent of A equals the determinant of the modified matrix? When does a real square matrix have the property that every real matrix with the…
We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.
To a digraph with a choice of certain integral basis, we construct a CW complex, whose integral singular cohomology is canonically isomorphic to the path cohomology of the digraph as introduced in \cite{GLMY}. The homotopy type of the CW…
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
In this paper, we introduce a graph structure, called non-zero component graph on finite dimensional vector spaces. We show that the graph is connected and find its domination number and independence number. We also study the…
We study the structure of bounded degree polynomials over finite fields. Haramaty and Shpilka [STOC 2010] showed that biased degree three or four polynomials admit a strong structural property. We confirm that this is the case for degree…
In this study, the new algebraic properties related to bivariate Fibonacci polynomials has been given. We present the partial derivatives of these polynomials in the form of convolution of bivariate Fibonacci polynomials. Also, we define a…
Let $(X, d)$ be a semimetric space. A permutation $\Phi$ of the set $X$ is a combinatorial self similarity of $(X, d)$ if there is a bijective function $f \colon d(X^2) \to d(X^2)$ such that $$ d(x, y) = f(d(\Phi(x), \Phi(y))) $$ for all…
In this paper the chordal graph structures of polynomial sets appearing in triangular decomposition in top-down style are studied when the input polynomial set to decompose has a chordal associated graph. In particular, we prove that the…
Roots of graph polynomials such as the characteristic polynomial, the chromatic polynomial, the matching polynomial, and many others are widely studied. In this paper we examine to what extent the location of these roots reflects the graph…
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…
We consider a certain mixed polynomial which is an extended Lens equation $L_{n,m}=\bar z^m-p(z)/q(z)$ with $\text{degree}\, q=n$, $\text{degree}\, p<n$ whose numerator is a mixed polynomial of degree $(n+m;n,m)$. Then we consider its…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…
In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of an approach exposed in cond-mat/0209112 and find that this…
The partial Petrial polynomial was first introduced by Gross, Mansour, and Tucker as a generating function that enumerates the Euler genera of all possible partial Petrials on a ribbon graph. Yan and Li later extended this polynomial…
We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the…
Constructions of directed configuration graphs based on a given bi-degree distribution were introduced in random graph theory some years ago. These constructions lead to graphs where the degrees of two nodes belonging to the same edge are…
When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…
Discrete models have a long tradition in engineering, including finite state machines, Boolean networks, Petri nets, and agent-based models. Of particular importance is the question of how the model structure constrains its dynamics. This…