• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Hormone molecular biology and clinical investigation. >On the b-Domatic Number of Graphs
【24h】

On the b-Domatic Number of Graphs

机译：b-Domatic数量的图表

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A set of vertices S in a graph G = (V, E) is a dominating set if every vertex not in S is adjacent to at least one vertex in S. A domatic partition of graph G is a partition of its vertex-set V into dominating sets. A domatic partition ?? of G is called b-domatic if no larger domatic partition of G can be obtained from ?? by transferring some vertices of some classes of ?? to form a new class. The minimum cardinality of a b-domatic partition of G is called the b-domatic number and is denoted by bd(G). In this paper, we explain some properties of b-domatic partitions, and we determine the b-domatic number of some families of graphs.
机译：一组顶点年代图G = (V, E)如果每个顶点不在S是支配集相邻的至少一个顶点在美国domatic图G是一个分区的分区点集V到支配集。分区?更大的G可以获得domatic分区从? ?类? ?基数b-domatic分区的G称为b-domatic号码和用bd (G)。b-domatic分区,我们确定的b-domatic一些家庭的图表。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号