首页> 外文期刊>International Journal of Engineering & Technology >Rainbow Connection Number and Chromatic Index of Rough Ideal based Rough Edge Cayley Graph
【24h】

Rainbow Connection Number and Chromatic Index of Rough Ideal based Rough Edge Cayley Graph

机译:基于粗糙理想Cayley图的Rainbow连接数和色指数

获取原文
           

摘要

Rainbow connection number and chromatic index are two significant parameters in the study of graph theory. In this work, rainbow connection number and chromatic index of Rough Ideal based?Rough Edge Cayley Graph G(T(J)) are evaluated. We prove that the rainbow connection number of G(T(J)) is 2 and the chromatic index of G(T(J)) is 2(2n^m)(3m^1): Rainbow connection number and chromatic index are two significant parameters in the study of graph theory. In this work, rainbow connection number and chromatic index of Rough Ideal based Rough Edge Cayley Graph G ( T J ) are evaluated. We prove that the rainbow connection number of G ( T J ) is 2 and the chromatic index of G ( T J ) is 2( 2 n - m )( 3 m - 1 ) .
机译:彩虹连接数和色度指数是图论研究中的两个重要参数。在这项工作中,评估了基于粗糙理想的粗糙边Cayley图G(T(J))的彩虹连接数和色指数。我们证明G(T(J))的彩虹连接数为2,G(T(J))的色指数为2(2n ^ m)(3m ^ 1):彩虹连接数和色指数为2图论研究中的重要参数。在这项工作中,评估了基于粗糙理想的粗糙边缘Cayley图G(T J)的彩虹连接数和色指数。我们证明G(T J)的彩虹连接数为2,G(T J)的色指数为2(2 n-m)(3 m-1)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号