Related papers: Primitive weakly distance-regular circulant digrap…

In this work, we have introduced and studied some basic geometric properties of extended weakly symmetric spaces. After classification of this structure we have also established the existence of such a space by presenting a non-trivial…

In this paper, we give a characterization of distance matrices of distance-regular graphs to be invertible.

In [Distrance-regular Cayley graphs on dihedral groups, J. Combin. Theory Ser B 97 (2007) 14--33], Miklavi\v{c} and Poto\v{c}nik proposed the problem of characterizing distance-regular Cayley graphs, which can be viewed as an extension of…

The paper provides the first constructions of strongly regular graphs and association schemes from weakly regular plateaued functions over finite fields of odd characteristic. We generalize the construction method of strongly regular graphs…

We classify the distance-regular Cayley graphs with least eigenvalue $-2$ and diameter at most three. Besides sporadic examples, these comprise of the lattice graphs, certain triangular graphs, and line graphs of incidence graphs of certain…

We solve the long-standing existence problem of vertex-primitive 2-arc-transitive digraphs by constructing an infinite family of such digraphs.

In this paper we give a first attempt to define and study stable distributions with respect to the weak generalized convolution, focusing our attention on the symmetric weakly stable distribution. As in the case of the classical…

This paper examines various kinds of subspaces of the non-commutative spaces that are modelled on quasi-projective commutative schemes. It is shown how intersections and unions of weakly closed subspaces, closed subspaces, their weakly open…

We introduce relative homological and weakly homological categories, where ``relative'' refers to a distinguished class of normal epimorphisms. It is a generalization of homological categories, but also protomodular categories can be…

Noncrossing arc diagrams are combinatorial models for permutations that encode information about lattice congruences of the weak order and about the associated discrete geometry. In this paper, we consider two related, analogous models for…

We compute the elementary divisors of the adjacency and Laplacian matrices of families of polar graphs. These graphs have as vertices the isotropic one-dimensional subspaces of finite vector spaces with respect to non-degenerate forms, with…

This is my dissertation about digraphs ordered by pp-constructability. We study in particular smooth digraphs, i.e., digraphs without sources or sinks, tournaments and semicomplete digraphs, orientations of paths and cycles, digraphs with…

Periodic orbits (equivalence classes of closed paths up to cyclic shifts) play an important role in applications of graph theory. For example, they appear in the definition of the Ihara zeta function and exact trace formulae for the spectra…

It is shown that exactly 7 distance-transitive cubic graphs among the existing 12 possess a particular ultrahomogeneous property with respect to oriented cycles realizing the girth that allows the construction of a related Cayley digraph…

The description of the subgroup structure of a non-commutative division ring is the subject of the intensive study in the theory of division rings in particular, and of the theory of skew linear groups in general. This study is still so far…

In this paper, we construct directed strongly regular graphs and divisible design graphs with new parameters merging some basic relations of so-called Tatra associations schemes. We also study the above association schemes, their fusions…

We study random graph models for directed acyclic graphs, an important class of networks that includes citation networks, food webs, and feed-forward neural networks among others. We propose two specific models, roughly analogous to the…

This paper begins the classification of all edge-primitive 3-arc-transitive graphs by classifying all such graphs where the automorphism group is an almost simple group with socle an alternating or sporadic group, and all such graphs where…

A graph is called primitive if its automorphism group acts primitively on the vertex set. In this paper, we prove a classification of the possible distance sequences of locally infinite primitive graphs. In particular we show that if a…

A definition of relative discrete spectrum of noncommutative W*-dynamical systems is given in terms of the basic construction of von Neumann algebras, motivated from three perspectives: Firstly, as a complementary concept to relative weak…