Related papers: Snake graphs and their characteristic polynomials
A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…
A plabic graph is a planar bicolored graph embedded in a disk, which satisfies some combinatorial conditions. Postnikov's boundary measurement map takes the space of positive edge weights of a plabic graph $G$ to a positroid cell in some…
This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…
In this paper we develop three characterizations for isomorphism of graphs. The first characterization is obtained by associating certain bitableaux with the graphs. We order these bitableaux by suitably defined lexicographic order and…
The Harary-Sachs theorem for $k$-uniform hypergraphs equates the codegree-$d$ coefficient of the adjacency characteristic polynomial of a uniform hypergraph with a weighted sum of subgraph counts over certain multi-hypergraphs with $d$…
We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$, two of which being adjacent whenever…
Learning a graph with a specific structure is essential for interpretability and identification of the relationships among data. It is well known that structured graph learning from observed samples is an NP-hard combinatorial problem. In…
The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…
A notion of Paley-Wiener spaces is introduced on combinatorial graphs. It is shown that functions from some of these spaces are uniquely determined by their values on some sets of vertices which are called the uniqueness sets. Such…
Graphs are widely used to represent complex information and signal domains with irregular support. Typically, the underlying graph topology is unknown and must be estimated from the available data. Common approaches assume pairwise node…
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…
Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…
In this paper, we analyse spectral properties of Seidel matrix (denoted by $S$) of connected threshold graphs. We compute the characteristic polynomial and determinant of Seidel matrix of threshold graphs. We derive formulas for the…
Symmetry is a key feature observed in nature (from flowers and leaves, to butterflies and birds) and in human-made objects (from paintings and sculptures, to manufactured objects and architectural design). Rotational, translational, and…
Stanley introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of the polynomials are positive. Stanley later gives a conjectured combinatorial interpretation for the coefficients of the…
Predator-prey networks originating from different aqueous and terrestrial environments are compared to assess if the difference in environments of these networks produce any significant difference in the structure of such predator-prey…
In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…
We give the first specific conjectures on how frequently graphs satisfy sufficient conditions for being uniquely characterized by spectral information. These conjectures arise from a theoretical framework that we developed based on…