The Rainbow Connection Number of a Flower (Cm, Kn) Graph and a Flower (C3, Fn) Graph
展开▼
机译:一朵花的彩虹连接编号( C ce:italic> m ce:italic> ce:inf>,< ce:italic> K ce:italic> n ce:italic> ce:inf>)图和一朵花( C ce:italic> 3 ce:italic> ce:inf>, F ce:italic> n ce:italic> ce:inf>)
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.
展开▼
机译:5 g ce:斜体的原子数据> [ k ce:斜体>] j ce: inf> ce:斜体>,6 f ce:斜体> [ k ce:斜体>] J CE:INF> CE:斜体>, nd ce:斜体> [ k ce:斜体> J CE:INF> CE:斜体>( n ce:斜体>?=?7,8),8 p ec:斜体> [ k ce:斜体>] j ce:inf> ce:斜体>和9 s ce :斜体> [ k ce:斜体>] j ce:inf> ce:inf> ce:italic>斜体>自动化rydberg系列<什么:sup =“post”> 129 CE:sup> xe i