Proper (Strong) Rainbow Connection and Proper (Strong) Rainbow Vertex Connection of Some Special Graphs
| العنوان: | Proper (Strong) Rainbow Connection and Proper (Strong) Rainbow Vertex Connection of Some Special Graphs |
|---|---|
| المؤلفون: | Yingbin Ma, Yanfeng Xue, Xiaoxue Zhang |
| المصدر: | Journal of Interconnection Networks. 23 |
| بيانات النشر: | World Scientific Pub Co Pte Ltd, 2023. |
| سنة النشر: | 2023 |
| مصطلحات موضوعية: | Computer Networks and Communications |
| الوصف: | The proper rainbow vertex connection number of [Formula: see text], denoted by [Formula: see text], is the smallest number of colors needed to properly color the vertices of [Formula: see text] so that [Formula: see text] is rainbow vertex connected. The proper strong rainbow vertex connection number of [Formula: see text], denoted by [Formula: see text], is the smallest number of colors needed to properly color the vertices of [Formula: see text] so that [Formula: see text] is strong rainbow vertex connected. These two concepts are inspired by the concept of proper (strong) rainbow connection number of graphs. In this paper, we first determine the values of [Formula: see text] and [Formula: see text] for some special graphs, such as all cubic graphs of order [Formula: see text], pencil graphs, circular ladders or Möbius ladders. Secondly, we obtain the values of [Formula: see text] and [Formula: see text] for some special graphs, such as all cubic graphs of order [Formula: see text], paths, cycles, wheels, complete multipartite graphs, pencil graphs, circular ladders and Möbius ladders. Finally, we characterize all the connected graphs [Formula: see text] with [Formula: see text] and [Formula: see text]. |
| تدمد: | 1793-6713 0219-2659 |
| الوصول الحر: | https://explore.openaire.eu/search/publication?articleId=doi_________::0782d0dd0d844c1ed3484af7ba1b197eTest https://doi.org/10.1142/s0219265922500062Test |
| رقم الانضمام: | edsair.doi...........0782d0dd0d844c1ed3484af7ba1b197e |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 17936713 02192659 |
|---|