Related papers: Fusions of the generalized Hamming scheme on a str…
We define generalized double affine Hecke algebras (GDAHA) of higher rank, attached to a non-Dynkin star-like graph D. This generalizes GDAHA of rank 1 defined in math.QA/0406480 and math.QA/0409261. If the graph is extended D4, then GDAHA…
A graph K is multiplicative if a homomorphism from any product G x H to K implies a homomorphism from G or from H. Hedetniemi's conjecture states that all cliques are multiplicative. In an attempt to explore the boundaries of current…
We combine two generalizations of ordinary Tur\'an problems. Given graphs $H$ and $F$ and a positive integer $n$, we study $rex(n, H, F )$, which is the largest number of copies of $H$ in $F$-free regular $n$-vertex graphs.
Fractional revival occurs between two vertices in a graph if a continuous-time quantum walk unitarily maps the characteristic vector of one vertex to a superposition of the characteristic vectors of the two vertices. This phenomenon is…
A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…
We introduce the notion of a generalised symmetry M of a hamiltonian H. It is a symmetry which has been broken in a very specific manner, involving ladder operators R and R*. In Theorem 1 these generalised symmetries are characterised in…
A hom-associative structure is a set $A$ together with a binary operation $\star$ and a selfmap $\alpha$ such that an $\alpha$-twisted version of associativity is fulfilled. In this paper, we assume that $\alpha$ is surjective. We show that…
This survey concerns regular graphs that are extremal with respect to the number of independent sets, and more generally, graph homomorphisms. More precisely, in the family of of $d$-regular graphs, which graph $G$ maximizes/minimizes the…
Characterizing graphs by their spectra is an important topic in spectral graph theory, which has attracted a lot of attention of researchers in recent years. It is generally very hard and challenging to show a given graph to be determined…
A spin system is a framework in which the vertices of a graph are assigned spins from a finite set. The interactions between neighbouring spins give rise to weights, so a spin assignment can also be viewed as a weighted graph homomorphism.…
A graph is called 1-planar if there exists its drawing in the plane such that each edge is crossed at most once. In this paper, we study 1-planar graph joins. We prove that the join $G+H$ is 1-planar if and only if the pair $[G,H]$ is…
Classical finite association schemes lead to a finite-dimensional algebras which are generated by finitely many stochastic matrices. Moreover, there exist associated finite hypergroups. The notion of classical discrete association schemes…
A graph is Schur-positive if its chromatic symmetric function expands nonnegatively in the Schur basis. All claw-free graphs are conjectured to be Schur-positive. We introduce a combinatorial object corresponding to a graph G, called a…
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…
Hansel's lemma states that $\sum_{H\in \mathcal{H}}|H| \geq n \log_2 n$ holds where $\mathcal{H}$ is a collection of bipartite graphs covering all the edges of $K_n$. We generalize this lemma to the corresponding multigraph covering problem…
A generalized de Bruijn digraph generalizes a de Bruijn digraph to the case where the number of vertices need not be a pure power of an integer. Hamiltonian cycles in these digraphs thus generalize regular de~Bruijn cycles, and we will thus…
Counting homomorphisms from a graph $H$ into another graph $G$ is a fundamental problem of (parameterized) counting complexity theory. In this work, we study the case where \emph{both} graphs $H$ and $G$ stem from given classes of graphs:…
In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…
In this paper we consider the question of when a strongly regular graph with parameters $((s+1)(st+1),s(t+1),s-1,t+1)$ can exist. These parameters arise when the graph is derived from a generalized quadrangle, but there are other examples…
Let $\mathcal F$ be a saturated fusion system on a finite $p$-group $S$, and let $P$ be a strongly $\mathcal F$-closed subgroup of $S$. We define the concept ``$\mathcal F$-essential subgroups with respect to $P$" which are some proper…