In this paper, we investigate the number of ones in rows of Pascal’s Rectangle. Using these results, we determine the existence of regular bipartite Steinhaus graphs. Also, we give an upper bound for the minimum degree of bipartite Steinhaus graphs.

Keywords: Steinhaus graph, regular graph, bipartite graph, generating string, doubly symmetric, Pascal’s rectangle