EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
05-XX Combinatorics
05Cxx Graph theory
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2

Displaying 21 – 30 of 30

Green kernel estimates and the full Martin boundary for random walks on lamplighter groups and Diestel–Leader graphs

Sara Brofferio, Wolfgang Woess (2005)

Annales de l'I.H.P. Probabilités et statistiques

Green's relations on the endomorphism monoid of a graph

Weimin Li (1995)

Mathematica Slovaca

Green's relations on the strong endomorphism monoid of a graph.

W. Li (1993)

Semigroup forum

Groups and homogeneous graphs

Bohdan Zelinka (1971)

Czechoslovak Mathematical Journal

Groups and polar graphs

Bohdan Zelinka (1976)

Časopis pro pěstování matematiky

Groups generated by k-root subgroups.

F.G. Timmesfeld (1991)

Inventiones mathematicae

Groups in which the prime graph is a tree

Maria Silvia Lucido (2002)

Bollettino dell'Unione Matematica Italiana

The prime graph $Γ (G)$ of a finite group $G$ is defined as follows: the set of vertices is $π (G)$ , the set of primes dividing the order of $G$ , and two vertices $p$ , $q$ are joined by an edge (we write $p \sim q$ ) if and only if there exists an element in $G$ of order $p q$ . We study the groups $G$ such that the prime graph $Γ (G)$ is a tree, proving that, in this case, $|π (G)| \leq 8$ .

Groups with the same prime graph as an almost sporadic simple group.

Khosravi, Behrooz (2009)

Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]

Growth functions and automatic groups.

Epstein, David B.A., Iano-Fletcher, Anthony R., Zwick, Uri (1996)

Experimental Mathematics

Growth in ${SL}_{3} (ℤ / p ℤ)$

H. A. Helfgott (2011)

Journal of the European Mathematical Society

Currently displaying 21 – 30 of 30

Previous Page 2