期刊信息

  • 刊名: 河北师范大学学报(自然科学版)Journal of Hebei Normal University (Natural Science)
  • 主办: 河北师范大学
  • ISSN: 1000-5854
  • CN: 13-1061/N
  • 中国科技核心期刊
  • 中国期刊方阵入选期刊
  • 中国高校优秀科技期刊
  • 华北优秀期刊
  • 河北省优秀科技期刊

图的关于边删除的外连通控制

  • 天津大学理学院, 天津 300072
  • DOI:

Outer-connected Domination upon Edge Removal in Graphs

摘要/Abstract

摘要:

对于图G=(V,E),如果V\S中的每个顶点都和S中至少1个顶点相邻,且G[V\S]是连通的,则称V的子集S是图G的外连通控制集.外连通控制集的最小基数γc(G)称为图G的外连通控制数.给出了树删去1条边后对应的外连通控制数的可达下界,定义了关于边删除的γc-严格图及γc-稳定图,并对其相关性质进行了讨论.

Abstract:

Let G=(V,E),a set S of vertices of a graph G is an outer-connected dominating set if every vertex in G[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.