Results 71 to 80 of about 4,433 (166)
Journal of Organizational Behavior, EarlyView.ABSTRACT As organizations increasingly adopt human‐AI teams (HATs), understanding how to enhance team performance is paramount. A crucially underexplored area for supporting HATs is training, particularly helping human teammates to work with these inorganic counterparts.
Caitlin M. Lancaster +5 more
wiley +1 more source
Rainbow Connection Number of Octopus Iteration Graphs
InPrimeThe 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.
Desi Rahmadani +4 more
doaj +1 more source
The Rainbow (Vertex) Connection Number of Pencil Graphs
Procedia Computer Science, 2015 AbstractAn edge colored graph G = (V(G), E(G)) is said rainbow connected, if any two vertices are connnected by a path whose edges have distinct colors. The rainbow connection number of G, denoted by rc(G), is the smallest positive integer of colors needed in order to make G rainbow connected. The vertex-colored graph G is said rainbow vertex-connected,
Dian N. S. Simamora, A. N. M. Salman
openaire +1 more source
On strong rainbow connection number
, 2010 A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. For any two vertices $u$ and $v$ of $G$, a rainbow $u-v$ geodesic in $G$ is a rainbow $u-v$ path of length $d(u,v)$, where $d(u,v)$ is the distance between $u$ and $v$.
Li, Xueliang, Sun, Yuefang
openaire +2 more sources
Rainbow Connection Number on Amalgamation of General Prism Graph
InPrime, 2019 Let be a nontrivial connected graph, the rainbow-k-coloring of graph G is the mapping of c: E(G)-> {1,2,3,…,k} such that any two vertices from the graph can be connected by a rainbow path (the path with all edges of different colors).
Rizki Hafri Yandera +2 more
doaj +1 more source
Hardness Results for Total Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2016 A total-colored path is total rainbow if both its edges and internal vertices have distinct colors. The total rainbow connection number of a connected graph G, denoted by trc(G), is the smallest number of colors that are needed in a total-coloring of G ...
Chen Lily, Huo Bofeng, Ma Yingbin
doaj +1 more source
THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS
BarekengThe concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs.
Ariestha Widyastuty Bustan +4 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2018 A total-colored graph G is rainbow total-connected if any two vertices of G are connected by a path whose edges and internal vertices have distinct colors.
Sun Yuefang, Jin Zemin, Tu Jianhua
doaj +1 more source
Color code techniques in rainbow connection
Electronic Journal of Graph Theory and Applications, 2018 Let G be a graph with an edge k-coloring γ : E(G) → {1, …, k} (not necessarily proper). A path is called a rainbow path if all of its edges have different colors.
Fendy Septyanto, Kiki A. Sugeng
doaj +1 more source
On Rainbow Connection Number of Some Graphs
International Journal of Engineering and Advanced Technology, 2019 The Rainbow connection number for the following graphs, two copies of Fan graph by a path , Arrow graph and Θ , Jellyfish graph and Cycle Cactus graph have been described in this ...
Shalini Rajendra Babu, N. Ramya
openaire +1 more source