This is the only book on the topic of geometric configurations of points and lines. It presents
in detail the history of the topic, with its surges and declines since its beginning in 1876. It …

We consider the class of I‐graphs I (n, j, k), which is a generalization over the class of the
generalized Petersen graphs. We study different properties of I‐graphs, such as …

The well-known Petersen graph G (5, 2) admits a semi-regular automorphism α acting on
the vertex set with two orbits of equal size. This makes it a bicirculant. It is shown that …

Symmetry properties of the three 10-cages on 70 vertices are investigated. Being bipartite,
these graphs are Levi graphs of triangle-and quadrangle-free (353) configurations. For each …

We call a polytope P of dimension 3 admissible if it has the following two properties:(1) for
each vertex of P the set of its first-neighbours is coplanar;(2) all planes determined by the …

The genus of the GRAY graph is 7 - ScienceDirect Skip to main contentSkip to article Elsevier
logo Journals & Books Help Search My account Sign in View PDF Download full issue Search …

In 1950 a class of generalized Petersen graphs was introduced by Coxeter and around
1970 popularized by Frucht, Graver and Watkins. The family of $ I $-graphs mentioned in …

An n-bicirculant is a graph having an automorphism with two orbits of length n and no other
orbits. Symmetry properties of p-bicirculants, pa prime, are extensively studied. In particular …

A graph is said to be vertex-transitive if its automorphism group acts transitively on the vertex
set. Some recent developments and possible future directions regarding two famous open …

In the paper we show that all combinatorial triangle-free configurations for v≤ 18 are
geometrically realizable. We also show that there is a unique smallest astral (18 3) triangle …