Rainbow Connection Number of Octopus Iteration Graphs

The rainbow connection number of a graph G denoted by rc(G) is the minimum number of colors used to color the edges in G, such that every pair of vertices is connected by a path with all different colors. In 2008, Chartrand et al. first introduced the concept of rainbow connection numbers. They int...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής

Κύριοι συγγραφείς:	Desi Rahmadani, Adinda Evelyn Giyanatta, Dina Pratiwi, Mahmuddin Yunus, Vita Kusumasari
Μορφή:	Artigo
Γλώσσα:	Inglês
Έκδοση:	UIN Syarif Hidayatullah 2024-11-01
Σειρά:	InPrime
Θέματα:	classes of octopus iteration graphs octopus chain graph octopus ladder graph rainbow connection number.
Διαθέσιμο Online:	https://journal.uinjkt.ac.id/index.php/inprime/article/view/41414
Ετικέτες:	Προσθήκη ετικέτας Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!