Related papers: A Nonvanishing Spectral Gap for AKLT Models on Gen…
We investigate when a complete graph $K_n$ with some edges deleted is determined by its adjacency spectrum. It is shown to be the case if the deleted edges form a matching, a complete graph $K_m$ provided $m \leq n-2$, or a complete…
In this work we propose a random graph model that can produce graphs at different levels of sparsity. We analyze how sparsity affects the graph spectra, and thus the performance of graph neural networks (GNNs) in node classification on…
In this paper we introduce a spectra preserving relation between graphs with loops and graphs without loops. This relation is achieved in two steps. First, by generalizing spectra results got on (m, k)-stars to a wider class of graphs, the…
Deep neural networks (DNNs) achieve state-of-the-art performance on many tasks, but this often requires increasingly larger model sizes, which in turn leads to more complex internal representations. Explainability techniques (XAI) have made…
We offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that equality is attained if and only if the…
A graph $G$ is said to be $k$-extendable if every matching of size $k$ in $G$ can be extended to a perfect matching of $G$, where $k$ is a positive integer. We say $G$ is $1$-excludable if for every edge $e$ of $G$, there exists a perfect…
Eigenspectra that fill regions in the complex plane have been intriguing to many, inspiring research from random matrix theory to esoteric semi-infinite bounded non-Hermitian lattices. In this work, we propose a simple and robust ansatz for…
The reconfiguration graph of the $k$-colourings, denoted $\mathcal{R}_k(G)$, is the graph whose vertices are the $k$-colourings of $G$ and two colourings are adjacent in $\mathcal{R}_k(G)$ if they differ in colour on exactly one vertex. In…
A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges, and the tessellation cover number, denoted by $T(G)$, is the size…
In this work, we study the spectral form factor of random matrix models which exhibit a large number of degenerate ground states accompanied by a macroscopic gap in the spectrum. The central aim of this work is to understand how the…
A graphon is a limiting object used to describe the behaviour of large networks through a function that captures the probability of edge formation between nodes. Although the merits of graphons to describe large and unlabelled networks are…
We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…
Symmetry-protected topological (SPT) phases are many-body quantum states that are topologically nontrivial as long as the relevant symmetries are unbroken. In this work we show that SPT phases are also well defined for average symmetries,…
Let $G$ be a connected graph with minimum degree $\delta(G)$ and vertex-connectivity $\kappa(G)$. The graph $G$ is $k$-connected if $\kappa(G)\geq k$, maximally connected if $\kappa(G) = \delta(G)$, and super-connected (or super-$\kappa$)…
A graph $G$ is a non-separating planar graph if there is a drawing $D$ of $G$ on the plane such that (1) no two edges cross each other in $D$ and (2) for any cycle $C$ in $D$, any two vertices not in $C$ are on the same side of $C$ in $D$.…
If the vertices of a graph $G$ are colored with $k$ colors such that no adjacent vertices receive the same color and the sizes of any two color classes differ by at most one, then $G$ is said to be equitably $k$-colorable. Let $|G|$ denote…
Graph Neural Networks (GNNs) are exemplary deep models designed for graph data. Message passing mechanism enables GNNs to effectively capture graph topology and push the performance boundaries across various graph tasks. However, the trend…
We consider (not necessarily proper) colorings of the vertices of a graph where every color is thoroughly distributed, that is, appears in every open neighborhood. Equivalently, every color is a total dominating set. We define $\td(G)$ as…
A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1 <= i <= l. In this paper, we focus on…
Let $G=(V,E)$ be a connected graph, where $V=\{v_1, v_2, \cdots, v_n\}$ and $m=|E|$. $d_i$ will denote the degree of vertex $v_i$ of $G$, and $\Delta=\max_{1\leq i \leq n} d_i$. The ABC matrix of $G$ is defined as $M(G)=(m_{ij})_{n \times…