...
首页> 外文期刊>Asian Journal of Current Engineering Maths >Degree Equitable Connected Domination in Fuzzy Graphs
【24h】

Degree Equitable Connected Domination in Fuzzy Graphs

机译:模糊图的度等度连通支配

获取原文
           

摘要

Let be a fuzzy graph. Let and be two vertices of . A fuzzy connected dominating set is to be a fuzzy equitable connected dominating set if for every there exists a vertex such that and where denotes degree of vertex and denotes the degree of vertex and . The minimum cardinality of fuzzy equitable connected domination set is denoted by . In this paper we introduce the concept of fuzzy equitable connected dominating set. Also we obtain some interesting results for this new parameter in equitable connected domination in fuzzy graphs.
机译:设为模糊图。设和为的两个顶点。如果每个存在一个顶点,且其中表示顶点度,表示顶点度和,则模糊连通支配集将成为模糊等价连通支配集。模糊等价连通支配集的最小基数用表示。本文介绍了模糊等价连通支配集的概念。对于模糊图中的等价连通支配关系中的新参数,我们也获得了一些有趣的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号