Prime graph components of finite almost simple groups
Problemas aditivos y grafos de Cayley.
Properties of digraphs connected with some congruence relations
The paper extends the results given by M. Křížek and L. Somer, On a connection of number theory with graph theory, Czech. Math. J. 54 (129) (2004), 465–485 (see [5]). For each positive integer define a digraph whose set of vertices is the set and for which there is a directed edge from to if The properties of such digraphs are considered. The necessary and the sufficient condition for the symmetry of a digraph is proved. The formula for the number of fixed points of is established....
Propriétés des diagrammes de Cayley
Průměr grafu pologrupy
Průměr grafu systému vlastních podpologrup komutativní pologrupy
Qualgebras and knotted 3-valent graphs
This paper is devoted to new algebraic structures, called qualgebras and squandles. Topologically, they emerge as an algebraic counterpart of knotted 3-valent graphs, just like quandles can be seen as an "algebraization" of knots. Algebraically, they are modeled after groups with conjugation and multiplication/squaring operations. We discuss basic properties of these structures, and introduce and study the notions of qualgebra/squandle 2-cocycles and 2-coboundaries. Knotted 3-valent graph invariants...
Quasigroups and Factorisation of Complete Digraphs
Quasirecognition by prime graph of where is a prime.
Quasirecognition by prime graph of the simple group .
Quasirecognition of a class of finite simple groups by the set of element orders.
Quotients of Infinite Reflection Groups.
Random Cayley graphs are expanders: a simple proof of the Alon-Roichman theorem.
Random walk on a building of type Ãr and brownian motion of the Weyl chamber
In this paper we study a random walk on an affine building of type Ãr, whose radial part, when suitably normalized, converges toward the brownian motion of the Weyl chamber. This gives a new discrete approximation of this process, alternative to the one of Biane (Probab. Theory Related Fields89 (1991) 117–129). This extends also the link at the probabilistic level between riemannian symmetric spaces of the noncompact type and their discrete counterpart, which had been previously discovered by Bougerol...
Random Walks on Generalized Lattices.
Rank three residually connected geometries for , revisited.
Reachability relations and the structure of transitive digraphs.
Recognizability of finite groups by Suzuki group
Let be a finite group. The main supergraph is a graph with vertex set in which two vertices and are adjacent if and only if or . In this paper, we will show that if and only if , where .
Recognizing circulant graphs of prime order in polynomial time.
Recognizing graph theoretic properties with polynomial ideals.