关于紧图的一些研究结果  

Some Research Results about Compact Graph

作　　者：斯琴巴特尔[1] 王井玉[1] 

机构地区：[1]内蒙古民族大学数学学院,内蒙古通辽028043

出　　处：《数学的实践与认识》2015年第7期296-303,共8页Mathematics in Practice and Theory

基　　金：国家自然科学基金(61262018)

摘　　要：双随机矩阵有许多重要的应用,紧图族可以看作是组合矩阵论中关于双随机矩阵的著名的Birkhoff定理的拓广,具有重要的研究价值.确定一个图是否紧图是个困难的问题,目前已知的紧图类尚且不多,介绍从某些已知的紧图出发不断构造紧图的加边法,可以构造无穷多个紧图族.Doubly stochastic matrix has many important applications, the family of compact graph can be seen as the generalization of the famous Birkhoff theorem which is about doubly stochastic matrix, has important research value. Determine whether a graph is a compact graph is an difficult problem, at present there are only few compact graphs known. In this paper, we introduced the method of constructing compact graphs continuously by adding pendant edges to some already known compact graphs. Using this method we can construct a lot of compact graphs.

关 键 词：紧图 超紧图 紧图族 加边法 实例 

分 类 号：O157.5[理学—数学]