標題: Bipartite Steinhaus graphs
作者: Lee, YS
Chang, GJ
應用數學系
Department of Applied Mathematics
關鍵字: Steinhaus graph;Steinhaus triangle;binary string;adjacency matrix
公開日期: 1-Sep-1999
摘要: A Steinhaus matrix is a symmetric 0-1 matrix [a(i,j)](nxn) such that a(i,i) = 0 for 0 less than or equal to i less than or equal to n - 1 and a(i,j) = (a(i-1,j-1) + a(i-1,j)) (mod 2) for 1 less than or equal to i < j less than or equal to 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.
URI: http://hdl.handle.net/11536/31135
ISSN: 1027-5487
期刊: TAIWANESE JOURNAL OF MATHEMATICS
Volume: 3
Issue: 3
起始頁: 303
結束頁: 310
Appears in Collections:Articles