Related papers: Locally s-distance transitive graphs and pairwise …
In this paper, we examine the structure of vertex- and edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using…
We define the $p$-adic trace of certain rank-one local systems on the multiplicative group over $p$-adic numbers, using Sekiguchi and Suwa's unification of Kummer and Artin-Schrier-Witt theories. Our main observation is that, for every…
We consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice. We assume that once walks meet, they coalesce. In $2d$, we classify the collective behavior of these walks under mild…
The graph layouts used for complex network studies have been mainly been developed to improve visualization. If we interpret the layouts in metric spaces such as Euclidean ones, however, the embedded spatial information can be a valuable…
Graph theory is a branch of mathematics in which pair-wise relations between objects are studied. My PhD thesis, supervised by David R. Wood, introduces and investigates a new family of graphs, called link graphs, that generalises the…
Symmetries are known to dictate important physical properties and can be used as a design principle in particular in wave physics, including wave structures and the resulting propagation dynamics. Local symmetries, in the sense of a…
Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…
From longitudinal biomedical studies to social networks, graphs have emerged as a powerful framework for describing evolving interactions between agents in complex systems. In such studies, after pre-processing, the data can be represented…
We view a design $\mathcal{D}$ as a set of $k$-subsets of a fixed set $X$ of $v$ points. A $k$-subset of $X$ is at distance $i$ from $\mathcal{D}$ if it intersects some $k$-set in $\mathcal{D}$ in $k-i$ points, and no subset in more than…
We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all $k \geq 3$, the $k$-CS-transitive such graphs.
The distribution of distances in the star graph $ST_n$, ($1<n\in\Z$), is established, and subsequently a threaded binary tree is obtained that realizes an orientation of $ST_n$ whose levels are given by the distances to the identity…
A criterion is established for the transitivity of connectedness in a transfinite graph. Its proof is much shorter than a prior argument published previously for that criterion.
The class A of countable groups that admit a faithful, transitive, amenable -- in the sense that there is an invariant mean -- action on a set has been widely investigated in the past. In this paper, we no longer require the action to be…
We establish a canonical correspondence between connected quandles and certain configurations in transitive groups, called quandle envelopes. This correspondence allows us to efficiently enumerate connected quandles of small orders, and…
In this paper, firstly, we provide some necessary and sufficient conditions for generalized Cayley graphs on abelian groups to be bipartite. Secondly, we deduce several necessary and sufficient conditions for generalized Cayley graphs on…
We introduce the notion of recurrence and transience for graphs over non-Archimedean ordered field. To do so we relate these graphs to random walks of directed graphs over the reals. In particular, we give a characterization of the real…
We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding…
We show a simple geometric procedure for an extension of a loop realized as the image $\Sigma ^{\ast}$ of a sharply transitive section in a subgroup $G^{\ast}$ of the projective linear group $PGL(n-1, \mathbb K)$ to a loop realized as the…
Semi-transitive graphs, defined in \cite{hps98} as examples where ``uniform percolation" holds whenever $p>p_c$, are a large class of graphs more general than quasi-transitive graphs. Let $G$ be a semi-transitive graph with one end which…
The construction of the Leavitt path algebra associated to a directed graph $E$ is extended to incorporate a family $C$ consisting of partitions of the sets of edges emanating from the vertices of $E$. The new algebras, $L_K(E,C)$, are…