Related papers: Large Cayley graphs of small diameter
We prove that the number of iterations taken by the Weisfeiler-Leman algorithm for configurations coming from Schreier graphs is closely linked to the diameter of the graphs themselves: an upper bound is found for general Schreier graphs,…
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. All of our algorithms run in O(n) time, where n is the number of vertices in the graph. In our proofs, we present an embedding algorithm for…
For many graph-related problems, it can be essential to have a set of structurally diverse graphs. For instance, such graphs can be used for testing graph algorithms or their neural approximations. However, to the best of our knowledge, the…
Given a finite group $G$ and a set $A$ of generators, the diameter diam$(\Gamma(G,A))$ of the Cayley graph $\Gamma(G,A)$ is the smallest $\ell$ such that every element of $G$ can be expressed as a word of length at most $\ell$ in $A \cup…
The feedback set problems are about removing the minimum number of vertices or edges from a graph to break all its cycles. Much effort has gone into understanding their complexity on planar graphs as well as on graphs of bounded degree. We…
A digraph is called an $n$-Cayley digraph if its automorphism group has an $n$-orbit semiregular subgroup. We determine the splitting fields of $n$-Cayley digraphs over abelian groups and compute a bound on their algebraic degrees, before…
Recently Chase determined the maximum possible number of cliques of size $t$ in a graph on $n$ vertices with given maximum degree. Soon afterward, Chakraborti and Chen answered the version of this question in which we ask that the graph…
We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…
We study upper bounds for the first non-zero eigenvalue of the Steklov problem defined on finite graphs with boundary. For finite graphs with boundary included in a Cayley graph associated to a group of polynomial growth, we give an upper…
For every infinite sequence of simple groups of Lie type of growing rank we exhibit connected Cayley graphs of degree at most 10 such that the isoperimetric number of these graphs converges to 0. This proves that these graphs do not form a…
Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…
A clique transversal in a graph is a set of vertices intersecting all maximal cliques. The problem of determining the minimum size of a clique transversal has received considerable attention in the literature. In this paper, we initiate the…
We prove an upper bound on the number of pairwise strongly cospectral vertices in a normal Cayley graph, in terms of the multiplicities of its eigenvalues. We use this to determine an explicit bound in Cayley graphs of $\mathbb{Z}_2^d$ and…
Let $q$ be a non-degenerate quadratic form defined on an $F$ vector space $V$ and $a \in F$. We consider the Cayley graph on $V$ with generating set $\{x \in V \mid q(x) = a\}$ and study its diameter and girth. In particular, if $F$ is a…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…
We show that every non-trivial compact connected group and every non-trivial general or special linear group over an infinite field admits a generating set such that the associated Cayley graph has infinite diameter.
The recently introduced \emph{Degree Preserving Growth} model (Nature Physics, \DOI{10.1038/s41567-021-01417-7}) uses matchings to insert new vertices of prescribed degrees into the current graph of an ever-growing graph sequence. The…
Let $\Gamma$ be a group and $(\Gamma_n)_{n=1} ^{\infty}$ be a descending sequence of finite-index normal subgroups. We establish explicit upper bounds on the diameters of the directed Cayley graphs of the $\Gamma/\Gamma_n$ , under some…
This article provides sharp bounds for the maximum number of edges possible in a simple graph with restricted values of two of the three parameters, namely, maxi- mum matching size, independence number and maximum degree. We also construct…
This work investigates the parameterized complexity of three related graph modification problems. Given a directed graph, a distinguished vertex, and a positive integer k, Minimum Indegree Deletion asks for a vertex subset of size at most k…