THE RAINBOW TOTAL-CONNECTION NUMBER OF AMALGAMATION OF SOME GRAPHS

• المؤلف الرئيسي: Arbain
• التنسيق: Theses
• اللغة: Indonesia
• الموضوعات: Matematika
• الوصول للمادة أونلاين: https://digilib.itb.ac.id/gdl/view/34768

All graph considered in this thesis are finite, simple, and undirected. Let G = (V (G);E(G)) be a nontrivial connected graph and k be a natural number. A mapping c : V (G) U E(G) ->f(1; 2; .... ; k) is called a rainbow total-k-coloring if any two vertices x and y in V (G) there exists a x-y p...