We characterize bipartite Steinhaus graphs in three ways by partitioning them into four
classes and we describe the color sets for each of these classes. An interesting recursion …

Let G be a finite group of order n and S be a subset of G not containing the identity element
of G. Let p (0< p< 1) be a fixed number. We define the set of all labelled Cayley digraphs X …

In [11] it is shown that the theory of almost all graphs is first-order complete. Furthermore, in
[3] a collection of first-order axioms are given from which any first-order property or its …

A generalized Steinhaus graph of order n and type s is a graph with n vertices whose
adjacency matrix (ai, j) satisfies the relation where 2≦ i≦ n− 1, i+ s (i− 1≦ j≦ n, cr, i, j ϵ {0 …

A Steinhaus matrix is a symmetric 0-1 matrix $[a_ {i, j}] _ {n\times n} $ such that $ a_ {i, i}= 0$
for $0\le i\le n-1$ and $ a_ {i, j}\equiv (a_ {i-1, j-1}+ a_ {i-1, j})(\mbox {mod} 2) $ for $1\le i\lt …