| 图的控制研究 |
| |
| 引用本文： | 罗茂才,曹李堂,韩卫国.图的控制研究[J].西安文理学院学报,2007,10(1):62-65. |
| |
| 作者姓名： | 罗茂才 曹李堂 韩卫国 |
| |
| 作者单位： | 武警工程学院基础部 陕西西安710086 |
| |
| 摘 要： | 从关联矩阵和邻接矩阵出发,给出了自关联矩阵、自邻接矩阵和对图的顶点相关分割的定义,然后利用顶点的相关分割解决图的控制问题.结果表明,该方法是解决这类问题的一种简单而实用的方法.
|
| 关 键 词： | 自关联矩阵 自邻接矩阵 相关分割 控制 |
| 文章编号： | 1008-5564(2007)01-0062-04 |
| 修稿时间： | 2006年9月1日 |
Dominating and Covering of Graph |
| |
| LUO Mao-cai,CAO Li-tang,HAN Wei-guo.Dominating and Covering of Graph[J].Journal of Xi‘an University of Arts & Science:Natural Science Edition,2007,10(1):62-65. |
| |
| Authors: | LUO Mao-cai CAO Li-tang HAN Wei-guo |
| |
| Abstract: | Starting with incidence matrix and adjacency matrix,the definition of self-incidence matrix and self-adjacency matrix was given.The problem of the graphic dominating set with the help of apex correlation division was solved.It is considered to be a simple and effective solution to the kind of problem. |
| |
| Keywords: | self-incidence matrix self-adjacency matrix correlation division dominating |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
