Related papers: The characteristic polynomial of agraph containing…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…
We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.
We provide a generating function for the (graded) dimensions of M. Kontsevich's graph complexes of ordinary graphs. This generating function can be used to compute the Euler characteristic in each loop order. Furthermore, we show that…
In this paper, we give a reduced formula of the characteristic polynomial of $k$-uniform hypergraphs with a pendant edge. And the explicit characteristic polynomial and all distinct eigenvalues of $k$-uniform hyperpath are given.
Let G = (V;E) be a simple graph. We consider domination polynomial, matching polynomial and edge cover polynomial of G. Graphs which their polynomials have few roots can give sometimes a very surprising information about the structure of…
This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…
The nullity of a graph is the multiplicity of the eigenvalues zero in its spectrum. A signed graph is a graph with a sign attached to each of its edges. In this paper, we obtain the coefficient theorem of the characteristic polynomial of a…
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…
In recent years, the notion of characteristic polynomial of representations of Lie algebras has been widely studied. This paper provides more properties of these characteristic polynomials. For simple Lie algebras, we characterize the…
Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…
Distinctive power of the alliance polynomial has been studied in previous works, for instance, it has been proved that the empty, path, cycle, complete, complete without one edge and star graphs are characterized by its alliance polynomial.…
In this paper, we aim to address the open questions raised in various recent papers regarding characterization of circulant graphs with three or four distinct eigenvalues in their spectra. Our focus is on providing characterizations and…
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…
In this paper, we find computational formulae for generalized characteristic polynomials of graph bundles. We show that the number of spanning trees in a graph is the partial derivative (at (0,1)) of the generalized characteristic…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
We give a complete formula for the characteristic polynomial of hyperplane arrangements $\mathcal J_n$ consisting of the hyperplanes $x_i+x_j=1$, $x_k=0$, $x_l=1$, $ 1\leq i, j, k, l\leq n$. The formula is obtained by associating hyperplane…
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…
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…