On Compact Graphs
On Compact Graphs
复制标题
关于紧致图
DOI：
10.1007/s10114-004-0485-1
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
Jiongsheng Li
中科院分区：
文献类型：
--
作者：
Ping Wang;Jiongsheng Li
摘要设G为具有邻接矩阵a的有限简单图，设P (a)为其凸
AbstractLet 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.