Taiwanese Journal of Mathematics

BIPARTITE STEINHAUS GRAPHS

Yueh-Shin Lee and G. J. Chang

Full-text: Open access

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.

Article information

Source
Taiwanese J. Math., Volume 3, Number 3 (1999), 303-310.

Dates
First available in Project Euclid: 18 July 2017

Permanent link to this document
https://projecteuclid.org/euclid.twjm/1500407130

Digital Object Identifier
doi:10.11650/twjm/1500407130

Mathematical Reviews number (MathSciNet)
MR1706057

Zentralblatt MATH identifier
0936.05068

Subjects
Primary: 05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Keywords
Steinhaus graph Steinhaus triangle binary string adjacency matrix

Citation

Lee, Yueh-Shin; Chang, G. J. BIPARTITE STEINHAUS GRAPHS. Taiwanese J. Math. 3 (1999), no. 3, 303--310. doi:10.11650/twjm/1500407130. https://projecteuclid.org/euclid.twjm/1500407130


Export citation