Abstract
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 j \le n-1$. A Steinhaus graph is a graph whose adjacency matrix is a Steinhaus matrix. In this paper, we present a new characterization of bipartite Steinhaus graphs.
Citation
Yueh-Shin Lee. G. J. Chang. "BIPARTITE STEINHAUS GRAPHS." Taiwanese J. Math. 3 (3) 303 - 310, 1999. https://doi.org/10.11650/twjm/1500407130
Information
