| SOME PROPERTIES OF A CLASS OF INTERCHANGE GRAPHS |
| |
| 摘 要： | §１ＩｎｔｒｏｄｕｃｔｉｏｎＬｅｔＧｂｅａｃｏｎｎｅｃｔｅｄｇｒａｐｈｗｉｔｈｖｅｒｔｅｘ－ｓｅｔＶ（Ｇ）ａｎｄｅｄｇｅ－ｓｅｔＥ（Ｇ）．Ｄｅｎｏｔｅｂｙｅ＝（ｘ，ｙ）ｔｈｅｅｄｇｅｊｏｉｎｉｎｇｔｈｅｖｅｒｔｉｃｅｓｘａｎｄｙｏｆＧ．Ａｍ－ｃｌｉｑ...
|
| 关 键 词： | 交换图 矩阵 连通图 顶集 边集 |
| 收稿时间： | 24 September 1997 |
Some properties of a class of interchange graphs |
| |
| Authors: | Qian Jianguo Xiang Jumin |
| |
| Institution: | (1) Department of Mathematics, Xiamen University, 361005 Xiamen;(2) Qinghai Finance and Economics School, 810000 Xining |
| |
| Abstract: | Let U(R,S) denote the class of all (0,1)-m × n matrices having row sum vector R and column sum vector S. The interchange graph G(R,S) is the graph where the vertices are the matrices in U(R,S) and two vertices representing two such matrices are adjacent provided they differ by an interchange. It is proved that G(R,(1,1,...,1))
is a generalized Cartesian product of some Johnson Scheme graphs. Furthermore, its connectivity, diameter and transitivity
(vertex-, edge-) are also determined. |
| |
| Keywords: | (0 1)-matrix interchange graph generalized Cartesian product |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
|
