Search Results for ""

An arc-transitive graph, sometimes also called a flag-transitive graph, is a graph whose graph automorphism group acts transitively on its graph arcs (Godsil and Royle 2001, ...

The Grassmannian Gr(n,k) is the set of k-dimensional subspaces in an n-dimensional vector space. For example, the set of lines Gr(n+1,1) is projective space. The real ...

Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...

A path in a graph G is a subgraph of G that is a path graph (West 2000, p. 20). The length of a path is the number of edges it contains. In most contexts, a path must contain ...

A (general, asymmetric) lens is a lamina formed by the intersection of two offset disks of unequal radii such that the intersection is not empty, one disk does not completely ...

A permutation group is a finite group G whose elements are permutations of a given set and whose group operation is composition of permutations in G. Permutation groups have ...

An xyz embedding, also called an "xyz drawing," is a three-dimensional embedding such that every axis-parallel line contains either zero or two vertices. Such an embedding is ...

Having forms of different handedness which are not mirror-symmetric.

A multivariate polynomial (i.e., a polynomial in more than one variable) with all terms having the same degree. For example, x^3+xyz+y^2z+z^3 is a homogeneous polynomial of ...

Landau's function g(n) is the maximum order of an element in the symmetric group S_n. The value g(n) is given by the largest least common multiple of all partitions of the ...