相关论文: A Note on a Construction by Pavese and Smaldore

Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relationship between these two areas, which is that two vertices…

Graph classification aims to categorise graphs based on their structure and node attributes. In this work, we propose to tackle this task using tools from graph signal processing by deriving spectral features, which we then use to design…

The spectrum of the normalized Laplacian matrix cannot determine the number of edges in a graph, however finding constructions of cospectral graphs with differing number of edges has been elusive. In this paper we use basic properties of…

A graph $G = (V, E)$ of bounded degree has an adjacency operator~$A$ which acts on the Hilbert space $\ell^2(V)$. There are different kinds of measures of interest on the spectrum $\Sigma (A)$ of $A$. In particular, each vector $\xi \in…

Hoffmann-Ostenhof's Conjecture states that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a $2$-regular subgraph. In this paper, we show that the conjecture holds for claw-free subcubic…

Spectral hypergraph theory mainly concerns using hypergraph spectra to obtain structural information about the given hypergraphs. The study of cospectral hypergraphs is important since it reveals which hypergraph properties cannot be…

A graph algorithm is truly subquadratic if it runs in ${\cal O}(m^b)$ time on connected $m$-edge graphs, for some positive $b < 2$. Roditty and Vassilevska Williams (STOC'13) proved that under plausible complexity assumptions, there is no…

A \emph{uniform random intersection graph} $G(n,m,k)$ is a random graph constructed as follows. Label each of $n$ nodes by a randomly chosen set of $k$ distinct colours taken from some finite set of possible colours of size $m$. Nodes are…

By establishing relations between operators on compositions, we show that the posets of compositions arising from the right and left Pieri rules for noncommutative Schur functions can each be endowed with both the structure of dual graded…

We give a complete characterisation of the cubic graphs with no eigenvalues in the interval $(-2,0)$. There is one thin infinite family consisting of a single graph on $6n$ vertices for each $n \geqslant 2$, and five ``sporadic'' graphs,…

A planar graph $G$ is said to be non-separating if there exists an embedding of $G$ in $\mathbb{R}^2$ such that for any cycle $\mathcal{C}\subset G$, all vertices of $G\setminus \mathcal{C}$ are within the same connected component of…

In our previous paper, we classified all $r$-uniform hypergraphs with spectral radius at most $(r-1)!\sqrt[r]{4}$, which directly generalizes Smith's theorem for the graph case $r=2$. It is nature to ask the structures of the hypergraphs…

For fixed integers p and q, let f(n,p,q) denote the minimum number of colors needed to color all of the edges of the complete graph K_n such that no clique of p vertices spans fewer than q distinct colors. A construction is given which…

Following recent work by Koll\'{a}r and Sarnak, we study gaps in the spectra of large connected cubic and quartic graphs with minimum spectral gap. We focus on two sequences of graphs, denoted $\Delta_n$ and $\Gamma_n$ which are more…

A k-regular graph on v vertices is a divisible design graph with parameters (v, k, lambda_1 ,lambda_2, m, n) if its vertex set can be partitioned into m classes of size n, such that any two different vertices from the same class have…

We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vertex is a cover of a strongly regular graph or a complete graph. By studying the structure of such graphs, we characterize all graphs…

For a non-decreasing sequence $S = (s_1, s_2, \ldots, s_k)$ of positive integers, a packing $S$-coloring of a graph $G$ is a partition of $V(G)$ into $V_1, V_2, \ldots, V_k$ such that each $V_i$ has pairwise distance at least $s_i+1$. The…

In \cite{Chan95}, the authors classified the 2-extendable abelian Cayley graphs and posed the problem of characterizing all 2-extendable Cayley graphs. We first show that a connected bipartite Cayley (vertex-transitive) graph is…

In fair division of a connected graph $G = (V, E)$, each of $n$ agents receives a share of $G$'s vertex set $V$. These shares partition $V$, with each share required to induce a connected subgraph. Agents use their own valuation functions…

The existence of a partial quadrangle ${\mathsf{PQ}}(s, t, \mu)$ is equivalent to the existence of a diamond-free strongly regular graph ${\mathsf{SRG}}(1+s(t+1)+s^2t(t+1)/\mu, s(t+1), s-1, \mu)$. Recently, it is shown that there exists a…