The strong 3-rainbow index of edge-amalgamation of some graphs

Article

Abstract: Let G be a nontrivial, connected, and edge-colored graph of order n ≥ 3, where adjacent edges may be

Palabras claves:

Edge-amalgamation, Rainbow coloring, Rainbow tree, Strong k-rainbow index

Autores:

Awanis Z.Y., Martin Bača, Salman A.N.M., Saputro S.W., Semaničova-Fenovciková A.

Fuentes:

scopus