1. Introduction. A useful general strategy for the construction of interesting families of vertex-transitive graphs is to begin with some family of transitive permutation groups and to construct for… Expand

The orthogonality relation among subspaces of a finite vector space is studied here by means of the corresponding graph. In the case we consider, this graph has some highly symmetric induced… Expand

Abstract Let f ( m , n ) be the least integer N such that for every graph G with N vertices, either G contains a path of m vertices or the complement of G contains a vertex of degree at least n .… Expand

In this paper it is shown that every connected metacirculant with an odd number of vertices greater than one and with blocks of prime cardinality has a hamiltonian cycle.