Results 11 to 20 of about 15,119,957 (115)
Upper bounding rainbow connection number by forest number [PDF]
, 2022 A path in an edge-colored graph is rainbow if no two edges of it are colored the same, and the graph is rainbow-connected if there is a rainbow path between each pair of its vertices.
Lauri, Juho +3 more
core +3 more sources
Proper Rainbow Connection Number of Graphs [PDF]
, 2021 A path in an edge-coloured graph is called a rainbow path if its edges receive pairwise distinct colours. An edge-coloured graph is said to be rainbow connected if any two distinct vertices of the graph are connected by a rainbow path.
Schiermeyer Ingo, Doan Trung Duy
core +2 more sources
Distance-Local Rainbow Connection Number [PDF]
, 2022 Under an edge coloring (not necessarily proper), a rainbow path is a path whose edge colors are all distinct. The d-local rainbow connection number lrcd(G) (respectively, d-local strong rainbow connection number lsrcd(G)) is the smallest number of colors
Sugeng, Kiki A., Septyanto, Fendy
core +1 more source
Rainbow Connection Number of Double Quadrilateral Snake Graph [PDF]
, 2023 Let graph G = be a non trivial connected graph. A graph G with edge coloring is called a rainbow connection, if for every pair of vertices on a path has a different color.
Massalesse, Jusmawati +2 more
core +1 more source
, 2021 A graph is said rainbow connected if no path has more than one vertices of the same color inside. The minimum number of colors required to make a graph to be rainbow vertex-connected is called rainbow vertex connection-number and denoted by rvc(G ...
Akadji, Afifah Farhanah +3 more
core +1 more source
The Vertex-Rainbow Connection Number of Some Graph Operations [PDF]
, 2021 A path in an edge-colored (respectively vertex-colored) graph G is rainbow (respectively vertex-rainbow) if no two edges (respectively internal vertices) of the path are colored the same.
Ma Yingbin +5 more
core +1 more source
Graphs with rainbow connection number two [PDF]
, 2011 An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order ...
Kemnitz, Arnfried, Schiermeyer, Ingo
core +1 more source
Penentuan Rainbow Connection Number dan Strong Rainbow Connection Number pada Graf berlian. [PDF]
, 2017 Misalkan G = (V,E) adalah suatu graf. Suatu pewarnaan c : E(G) → {1,2,...,k}, k ∈ N pada graf G adalah suatu pewarnaan sisi di G sedemikian sehingga setiap sisi bertetangga boleh berwarna sama.
Suci, Riezsa Dessyluviani
core +1 more source
On the Rainbow Connection Number for Snowflake Graph [PDF]
, 2023 Let G be an arbitrary non-trivial connected graph. An edge-colored graph G is called a rainbow connected if any two vertices are connected by a path whose edges have distinct colors, such path is called a rainbow path.
Yulianti, Lyra +3 more
core +1 more source
Rainbow Connection Number dan Strong Rainbow Connection Number pada Graf komplemen dari Graf konjugasi grup dihedral [PDF]
, 2017 INDONESIA: Graf G dengan pewarnaan sisi disebut rainbow connected jika setiap titik pada graf G dihubungkan oleh lintasan yang memiliki sisi-sisi dengan warna berbeda.
Indahsari, Alvi Nur Laila
core