...
首页> 外文期刊>Procedia Computer Science >The Rainbow Connection Number of a Flower (C m , K n ) Graph and a Flower (C 3 , F n ) Graph
【24h】

The Rainbow Connection Number of a Flower (C m , K n ) Graph and a Flower (C 3 , F n ) Graph

机译:一朵花的彩虹连接编号( C m ,< ce:italic> K n )图和一朵花( C 3 F n

获取原文
   

获取外文期刊封面封底 >>

       

摘要

An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. Such a path is called a rainbow path. The smallest number of colors needed in order to make G rainbow connected is called the rainbow connection number of G , denoted by rc ( G ). In this paper, we determine the rainbow connection number of a flower ( C m , K n ) and a flower ( C 3 , F n ) graph.
机译:如果通过边缘具有不同颜色的路径连接了任意两个顶点,则边缘着色图G是彩虹连接的。这样的路径称为彩虹路径。为了使G彩虹连接所需的最小颜色数称为G的彩虹连接数,用rc(G)表示。在本文中,我们确定了花朵(C m,K n)和花朵(C 3,F n)图的彩虹连接数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号