Results 41 to 50 of about 1,117,749 (247)
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
The rainbow connection number of the enhanced power graph of a finite group
Electronic Journal of Graph Theory and Applications, 2023 Let G be a finite group. The enhanced power graph ΓGe of G is the graph with vertex set G and two distinct vertices are adjacent if they generate a cyclic subgroup of G. In this article, we calculate the rainbow connection number of ΓGe.
Luis A. Dupont +2 more
doaj +1 more source
Rainbow Turán Problems for Paths and Forests of Stars
The Electronic Journal of Combinatorics, 2017 For a fixed graph $F$, we would like to determine the maximum number of edges in a properly edge-colored graph on $n$ vertices which does not contain a rainbow copy of $F$, that is, a copy of $F$ all of whose edges receive a different color. This maximum, denoted by $ex^*(n,F)$, is the rainbow Turán number of $F$, and its systematic study was initiated
Daniel Johnston +2 more
openaire +4 more sources
Cross‐Scale Hierarchical Targeted Delivery System Based on Small‐Scale Magnetic Robots
Advanced Robotics Research, EarlyView.This article reviews a cross‐scale hierarchical targeted delivery system that integrates magnetic continuum robots and magnetic microrobots. By combining rapid long‐range navigation with precise microscale targeting, the system overcomes key limitations of single‐scale approaches.
Junjian Zhou +4 more
wiley +1 more source
Rainbow Connection on Amal(Fn,xz,m) Graphs and Amal(On,xz,m) Graphs
Contemporary Mathematics and Applications (ConMathA)Coloring graph is giving a color to a set of vertices and a set of edges on a graph. The condition for coloring a graph is that each color is different for each neighboring member graph.
Muhammad Usaid Hudloir +4 more
doaj +1 more source
Rainbow Connection Number of Graphs with Diameter 3
Discussiones Mathematicae Graph Theory, 2017 A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every pair of distinct vertices of G
Li Hengzhe, Li Xueliang, Sun Yuefang
doaj +1 more source
The Rainbow Vertex-Connection Number of Star Fan Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2018 A vertex-colored graph is said to be rainbow vertex-connected, if for every two vertices and in , there exists a path with all internal vertices have distinct colors.
Ariestha Widyastuty Bustan +1 more
doaj +1 more source
The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths [PDF]
Electronic Journal of Graph Theory and Applications, 2020 Summary: An edge-colored graph \(G\) is \textit{rainbow} \(k\)-\textit{connected}, if there are \(k\)-internally disjoint rainbow paths connecting every pair of vertices of \(G\). The rainbow \(k\)-connection number of \(G\), denoted by \(rc_k(G)\), is the minimum number of colors needed for which there exists a rainbow \(k\)-connected coloring for \(G\
Bety Hayat Susanti +2 more
openaire +2 more sources
Medical students' perspectives on body donation to science within the Italian context
Anatomical Sciences Education, EarlyView.Abstract Body donation is essential for medical education and research, supporting anatomical training and clinical competence. In Italy, national data on awareness of the legislation regulating body donation and factors shaping donation‐related decisions among healthcare trainees remain limited. This study investigated knowledge of the legal framework,
Antonietta Fazio +20 more
wiley +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