Código QR (código de barras bidimensional)

Rainbow connection number of comb product of graphs

<p><span>An edge-colored graph </span><span class="math inline"><em>G</em></span><span> is called a 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 required in order to make </span><sp...

תיאור מלא

שמור ב:
Principais autores: Dinny Fitriani, ANM Salman, Zata Yumni Awanis
פורמט: Artigo
שפה:Inglês
יצא לאור: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2022-09-01
סדרה:Electronic Journal of Graph Theory and Applications
נושאים:
comb product, rainbow connection number, rainbow path
גישה מקוונת:http://www.ejgta.org/index.php/ejgta/article/view/1225
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!

פריטים דומים