On Compact Graphs

被引：0

作者：

Ping WANG State Key Laboratory of Information Security

机构：

来源：

Acta Mathematica Sinica(English Series) | 2005年 / 21卷 / 05期

基金：

中国国家自然科学基金;

关键词：

Double stochastic matrix; Compaet; graph; Automorphism group;

D O I：

暂无

中图分类号：

O157.5 [图论];

学科分类号：

070104 ;

摘要：

Let G be a finite simple graph with adjacency matrix A,and let (A)be the convexelosure of the set of all permutation matrices commuting with A.G is said to be compact if everydoubly stochastic matrix which commutes with A is in (A).In this paper,we characterize 3-regularcompact graphs and prove that if G is a connected regular compact graph,G-v is also compact,andgive a family of almost regular compact connected graphs.

引用

页码：1087 / 1092

页数：6