Related papers: Properties of Full-Flag Johnson Graphs
We prove that any completely regular code with minimum eigenvalue in any geometric graph G corresponds to a completely regular code in the clique graph of G. Studying the interrelation of these codes, a complete characterization of the…
We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.
We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…
These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley…
In this paper we study invariant almost Hermitian geometry on generalized flag manifolds. We will focus on providing examples of K\"ahler like scalar curvature metric, that is, almost Hermitian structures $(g,J)$ satisfying $s=2s_{\rm C}$,…
A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…
Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…
This paper deals with the Cayley graph $\Cay,$ where the generating set consists of all block transpositions. A motivation for the study of these particular Cayley graphs comes from current research in Bioinformatics. We prove that…
Whiteley \cite{wh} gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined graphs, a family of graphs that contain the complete…
The study of bipartite maps (or Grothendieck's dessins d'enfants) is closely connected with geometry, mathematical physics and free probability. Here we study these objects from their permutation factorization formulation using a novel…
The Johnson filtration of the mapping class group of a compact, oriented surface is the descending series consisting of the kernels of the actions on the nilpotent quotients of the fundamental group of the surface. Each term of the Johnson…
We construct a new family of trivalent expanders tessellating hyperbolic surfaces with large isometry groups. These graphs are obtained from a family of Cayley graphs of nilpotent groups via $(\Delta-Y)$-transformations. We compare this…
We investigate Cayley graphs of graph products by showing that graph products with vertex groups that have isomorphic Cayley graphs yield isomorphic Cayley graphs.
A strongly polynomial sequence of graphs $(G_n)$ is a sequence $(G_n)_{n\in\mathbb{N}}$ of finite graphs such that, for every graph $F$, the number of homomorphisms from $F$ to $G_n$ is a fixed polynomial function of $n$ (depending on $F$).…
By identifying each standard flag with a trivalent Feynman diagram, the corresponding propagators can be read directly from the flag itself. Within the flag representation, the kinematic Jacobi identity (equivalently, the residue theorem on…
Graphs defined over a finite ring are well-studied in the literature. Due to their nature, these types of graphs connect several branches of mathematics, including algebra, number theory, matrix theory, and representation theory. In recent…
Let $G$ be a graph on $n$ vertices. The $k$-token graph (or symmetric $k$-th power) of $G$, denoted by $F_k(G)$ has as vertices the ${n\choose k}$ $k$-subsets of vertices from $G$, and two vertices are adjacent when their symmetric…
We introduce the concept of complete edge-colored permutation graphs as complete graphs that are the edge-disjoint union of "classical" permutation graphs. We show that a graph $G=(V,E)$ is a complete edge-colored permutation graph if and…
An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and…
A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real weights associated to their vertices such that a set of…