| 分裂图的区间图完全化问题（英文） |
| |
| 引用本文： | 张振坤,余敏.分裂图的区间图完全化问题（英文）[J].数学季刊,2015(2):308-316. |
| |
| 作者姓名： | 张振坤 余敏 |
| |
| 作者单位： | Department of Mathematics, Huanghuai University;Software College,Zhengzhou Raiway Vocational and Technical College |
| |
| 摘 要： | The interval graph completion problem on a graph G is to find an added edge set F such that G + F is an interval supergraph with the smallest possible number of edges. The problem has important applications to numerical algebra, V LSI-layout and algorithm graph theory etc; And it has been known to be N P-complete on general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the interval graph completion problem on split graphs is investigated.
|
| 关 键 词： | 区间图 algebra smallest completion vertex subgraph undirected layout independence disjoint |
| 本文献已被 CNKI 等数据库收录！ |
|
