| On Compact Graphs |
| |
| 作者姓名： | Ping WANG Jiong Sheng LI |
| |
| 作者单位： | [1]State Key Laboratory of Information Security, Graduate School, Chinese Academy of Sciences, Beijing 100039, P. R. China [2]Department of Mathematics, University of Science and Technology of China,Hefei 230026, P. R. China |
| |
| 基金项目： | Supported by National Natural Science Foundation of China （Grant No. 19971086） |
| |
| 摘 要： | Let G be a finite simple graph with adjacency matrix A, and let P（A） be the convex closure of the set of all permutation matrices commuting with A. G is said to be compact if every doubly stochastic matrix which commutes with A is in P（A）. In this paper, we characterize 3-regular compact graphs and prove that if G is a connected regular compact graph, G - v is also compact, and give a family of almost regular compact connected graphs.
|
| 关 键 词： | 紧图表 双随机矩阵 自同构群 矩阵交换 |
| 收稿时间： | 2002-12-04 |
| 修稿时间： | 2002-12-042004-09-02 |
On Compact Graphs |
| |
| Ping WANG Jiong Sheng LI.On Compact Graphs[J].Acta Mathematica Sinica,2005,21(5):1087-1092. |
| |
| Authors: | Ping Wang Jiong Sheng Li |
| |
| Institution: | (1) State Key Laboratory of Information Security, Graduate School, Chinese Academy of Sciences, Beijing 100039, P. R. China;(2) Department of Mathematics, University of Science and Technology of China, Hefei 230026, P. R. China |
| |
| Abstract: | Let G be a finite simple graph with adjacency matrix A, and let P̄̄(A) be the convex
closure of the set of all permutation matrices commuting with A. G is said to be compact if every
doubly stochastic matrix which commutes with A is in P̄(A). In this paper, we characterize 3–regular
compact graphs and prove that if G is a connected regular compact graph, G – v is also compact, and
give a family of almost regular compact connected graphs.
Supported by National Natural Science Foundation of China (Grant No. 19971086) |
| |
| Keywords: | Double stochastic matrix Compact graph Automorphism group |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
|
