Ground state incongruence in 2D spin glasses revisited.
Group actions on magic squares.
Group distances of Latin squares
Group inverses of matrices with path graphs.
Groupoids and the associative law. VII. Semigroup distance of SH-groupoids
Groupoids with non-associative triples on the diagonal
Groups acting on products of trees, tiling systems and analytic -theory.
Groups and homogeneous graphs
Groups and polar graphs
Groups generated by k-root subgroups.
Groups in which the prime graph is a tree
The prime graph of a finite group is defined as follows: the set of vertices is , the set of primes dividing the order of , and two vertices , are joined by an edge (we write ) if and only if there exists an element in of order . We study the groups such that the prime graph is a tree, proving that, in this case, .
Groups with the same prime graph as an almost sporadic simple group.
Growing Apollonian packings.
Growth functions and automatic groups.
Growth in
Growth of graph powers.
Growth rates for subclasses of Av(321).
Grundy number of graphs
The Grundy number of a graph G is the maximum number k of colors used to color the vertices of G such that the coloring is proper and every vertex x colored with color i, 1 ≤ i ≤ k, is adjacent to (i-1) vertices colored with each color j, 1 ≤ j ≤ i -1. In this paper we give bounds for the Grundy number of some graphs and cartesian products of graphs. In particular, we determine an exact value of this parameter for n-dimensional meshes and some n-dimensional toroidal meshes. Finally, we present an...
Guessing secrets.