頁籤選單縮合
| 題 名 | Bipartite Steinhaus Graphs |
|---|---|
| 作 者 | 李岳勳; 張鎮華; | 書刊名 | Taiwanese Journal of Mathematics |
| 卷 期 | 3:3 1999.09[民88.09] |
| 頁 次 | 頁303-310 |
| 分類號 | 319.76 |
| 關鍵詞 | Steinhaus graph; Steinhaus triangle; Binary string; Adjacency matrix; |
| 語 文 | 英文(English) |
| 英文摘要 | A Steinhaus matrix is a symmetric 0-1 maxtrix [ a ] such that a =0 for 0? i ? n-1 and a = (a +a ) (mod 2) for 1?i<j?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. |
本系統中英文摘要資訊取自各篇刊載內容。