Related papers: Genuinely nonabelian partial difference sets
Isoradial graphs are a natural generalization of regular graphs which give, for many models of statistical mechanics, the right framework for studying models at criticality. In this survey paper, we first explain how isoradial graphs…
H. Furstenberg defined Central sets in $\mathbb{N}$ by using the notions of topological dynamics, later Bergelson and Hindman characterized central sets in $\mathbb{N}$ and also in arbitrary semigroup in terms of algebra of Stone-\v{C}ech…
A graph is said to be {\em vertex-transitive non-Cayley} if its full automorphism group acts transitively on its vertices and contains no subgroups acting regularly on its vertices. In this paper, a complete classification of cubic…
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…
We introduce a new class of identifiable DAG models where the conditional distribution of each node given its parents belongs to a family of generalized hypergeometric distributions (GHD). A family of generalized hypergeometric…
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…
We give a way to construct group of pseudo-automorphisms of rational varieties of any dimension that fix pointwise the image of a cubic hypersurface of $P^n. These group are free products of involutions, and most of their elements have…
A subgroup of the automorphism group of a graph acts {\em half-arc-transitively} on the graph if it acts transitively on the vertex-set and on the edge-set of the graph but not on the arc-set of the graph. If the full automorphism group of…
One exact and two heuristic algorithms for determining the generators, orbits and order of the graph automorphism group are presented. A basic tool of these algorithms is the well-known individualization and refinement procedure. A search…
Sandpile groups are a subtle graph isomorphism invariant, in the form of a finite abelian group, whose cardinality is the number of spanning trees in the graph. We study their group structure for graphs obtained by attaching a cone vertex…
Recently, a new way of avoiding crossings in straight-line drawings of non-planar graphs has been investigated. The idea of partial edge drawings (PED) is to drop the middle part of edges and rely on the remaining edge parts called stubs.…
Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…
In analogy with epsilon-biased sets over Z_2^n, we construct explicit epsilon-biased sets over nonabelian finite groups G. That is, we find sets S subset G such that | Exp_{x in S} rho(x)| <= epsilon for any nontrivial irreducible…
Graph signal processing (GSP) provides a powerful framework for analyzing signals arising in a variety of domains. In many applications of GSP, multiple network structures are available, each of which captures different aspects of the same…
This article is a review of theoretical advances in the research field of algebraic geometry and Bayesian statistics in the last two decades. Many statistical models and learning machines which contain hierarchical structures or latent…
Recently, there has been interest in the question of whether a partial matrix in which many of the fully defined principal submatrices are PSD is approximately PSD completable. These questions are related to graph theory because we can…
We present an algebraic procedure for constructing Hamiltonians with several distinct partial dynamical symmetries (PDSs), of relevance to shape-coexistence phenomena. The procedure relies on a spectrum generating algebra encompassing…
Given a graph $A$ on a group $G$ and an equivalence relation $B$ on $G$, the $B$ super$A$ graph, whose vertex set is $G$ and two vertices $g$, $h$ are adjacent if and only if there exist $g^{\prime} \in[g]$ and $h^{\prime} \in[h]$ such that…
A \emph{proportionally dense subgraph} (PDS) is an induced subgraph of a graph with the property that each vertex in the PDS is adjacent to proportionally as many vertices in the subgraph as in the rest of the graph. In this paper, we study…
Strongly walk regular graphs (SWRGs or $s$-SWRGs) form a natural generalization of strongly regular graphs (SRGs) where paths of length~2 are replaced by paths of length~$s$. They can be constructed as coset graphs of the duals of…