Related papers: Binomial Cayley Graphs and Applications to Dynamic…

In this paper we introduce a new technique to analyze families of rankings focused on the study of structural properties of a new type of graphs. Given a finite number of elements and a family of rankings of those elements, we say that two…

The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry…

This paper initiates a systematic study of connections between undirected colored graphs and associated two-variable stable polynomials obtained via Cauchy transform-type formulas. Examples of such stable polynomials have played crucial…

We investigate Feynman graphs and their Feynman rules from the viewpoint of graph complexes. We focus on graph homology and on the appearance of cubical complexes when either reducing internal edges or when removing them by putting them on…

We expound a concise construction of finite groups and groupoids whose Cayley graphs satisfy graded acyclicity requirements. Our acyclicity criteria concern cyclic patterns formed by coset-like configurations w.r.t. subsets of the generator…

Strong cospectrality is an equivalence relation on the set of vertices of a graph that is of importance in the study of quantum state transfer in graphs. We construct families of abelian Cayley graphs in which the number of mutually…

In geometric group theory one uses group actions on spaces to gain information about groups. One natural space to use is the Cayley graph of a group. The Cayley graph arguments that one encounters tend to require local finiteness, and hence…

Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…

We review Bacry and Levy-Leblond's work on possible kinematics as applied to 2-dimensional spacetimes, as well as the nine types of 2-dimensional Cayley-Klein geometries, illustrating how the Cayley-Klein geometries give homogeneous…

We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…

We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…

Let $G$ be a finite, undirected $d$-regular graph and $A(G)$ its normalized adjacency matrix, with eigenvalues $1 = \lambda_1(A)\geq \dots \ge \lambda_n \ge -1$. It is a classical fact that $\lambda_n = -1$ if and only if $G$ is bipartite.…

We study the automorphisms of a Cayley graph that preserve its natural edge-colouring. More precisely, we are interested in groups G, such that every such automorphism of every connected Cayley graph on G has a very simple form: the…

In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…

We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges…

The Directed Power Graph of a group is a graph whose vertex set is the elements of the group, with an edge from $x$ to $y$ if $y$ is a power of $x$. The \textit{Power Graph} of a group can be obtained from the directed power graph by…

In this paper, we construct a family of quasi-strongly regular Cayley graphs $\Gamma_H(G)$ which is defined on a finite group $G$ with respect to a subgroup $H$ of $G$. We also compute its full automorphism group and characterize various…

Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…

In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of an approach exposed in cond-mat/0209112 and find that this…

We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…