| 图的关于边删除的外连通控制 |
| |
| 引用本文： | 田叶.图的关于边删除的外连通控制[J].河北师范大学学报(自然科学版),2012(4):332-335,354. |
| |
| 作者姓名： | 田叶 |
| |
| 作者单位： | 天津大学理学院,天津,300072 |
| |
| 摘 要： | 对于图G=(V,E),如果V\S中的每个顶点都和S中至少1个顶点相邻,且GV\S]是连通的,则称V的子集S是图G的外连通控制集.外连通控制集的最小基数~γc(G)称为图G的外连通控制数.给出了树删去1条边后对应的外连通控制数的可达下界,定义了关于边删除的~γc-严格图及~γc-稳定图,并对其相关性质进行了讨论.
|
| 关 键 词： | 外连通控制集 外连通控制数 边删除 ~γc-严格图 ~γc-稳定图 |
Outer-connected Domination upon Edge Removal in Graphs |
| |
| TIAN Ye.Outer-connected Domination upon Edge Removal in Graphs[J].Journal of Hebei Normal University,2012(4):332-335,354. |
| |
| Authors: | TIAN Ye |
| |
| Institution: | TIAN Ye(School of Sciences,Tianjin University,Tianjin 300072,China) |
| |
| Abstract: | Let G=(V,E),a set S of vertices of a graph G is an outer-connected dominating set if every vertex in V\S is adjacent to some vertex in S and the subgraph G is connected.The outer-connected domination number c(G) is the minimum size of such a set.A sharp lower bound for the outer-connected domination number of trees is established.Then the definitions of c-critical graphs and c-stable graphs upon edge removal are given and their relevant properties are discussed. |
| |
| Keywords: | outer-connected domination set outer-connected domination number edge removal c-critical graph c-stable graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
