相关论文: On polynomial digraphs

Let $G^\sigma$ be an orientation of a simple graph $G$. In this paper, the permanental polynomial of an oriented graph $G^\sigma$ is introduced. The coefficients of the permanental polynomial of $G^\sigma$ are interpreted in terms of the…

In multivariate statistics, acyclic mixed graphs with directed and bidirected edges are widely used for compact representation of dependence structures that can arise in the presence of hidden (i.e., latent or unobserved) variables. Indeed,…

Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…

Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite…

Consider a random polynomial $$ G(z):=\xi_0+\xi_1z+\dots+\xi_nz^n,\quad z\in\mathbb{C}, $$ where $\xi_0,\xi_1,\dots,\xi_{n}$ are independent real-valued random variables with probability density functions $f_0,\dots,f_n$. We give an…

We tackle several problems related to a finite irreducible crystallographic root system $\Phi$ in the real vector space $\mathbb E$. In particular, we study the combinatorial structure of the subsets of $\Phi$ cut by affine subspaces of…

To each polynomial $\v\in\F[x,y,z]$ is associated a Poisson structure on $\F^3$, a surface and a Poisson structure on this surface. When $\v$ is weight homogeneous with an isolated singularity, we determine the Poisson cohomology and…

Let $\Phi=(G, \varphi)$ be a complex unit gain graph (or $\mathbb{T}$-gain graph) and $A(\Phi)$ be its adjacency matrix, where $G$ is called the underlying graph of $\Phi$. The rank of $\Phi$, denoted by $r(\Phi)$, is the rank of $A(\Phi)$.…

Given a polynomial matrix P(x) of grade g and a rational function $x(y) = n(y)/d(y)$, where $n(y)$ and $d(y)$ are coprime nonzero scalar polynomials, the polynomial matrix $Q(y) :=[d(y)]^gP(x(y))$ is defined. The complete eigenstructures of…

Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce…

We describe the topology of a general polynomial mapping $F=(f, g):X\to\Bbb C^2$, where $X$ is a complex plane or a complex sphere.

Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

Let $S$ be a split graph with bipartition $(K,I)$ and let $\Phi(S)$ be the factor graph associated with $S$, a multigraph on $I$ whose encodes the combinatorial information about 2-switch transformations in $S$. We study induced paths and…

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…

In this paper, we study connections between the structure of a group and the structure of the group (under pointwise product) of its polynomial functions.

Polynomials commute under composition are referred to as commuting polynomials. In this paper, we study division properties for commuting polynomials with rational (and integer) coefficients. As a consequence, we show an algebraic…

Let $G$ be a compact group, let $X$ be a Banach space, and let $P\colon L^1(G)\to X$ be an orthogonally additive, continuous $n$-homogeneous polynomial. Then we show that there exists a unique continuous linear map $\Phi\colon L^1(G)\to X$…

The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…

Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…