Results 51 to 60 of about 96,099 (217)
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 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
The strong rainbow vertex-connection of graphs [PDF]
, 2012 A vertex-colored graph $G$ is said to be rainbow vertex-connected if every two vertices of $G$ are connected by a path whose internal vertices have distinct colors, such a path is called a rainbow path. The rainbow vertex-connection number of a connected
Li, Xueliang, Mao, Yaping, Shi, Yongtang
core
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
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
On the inverse graph of a finite group and its rainbow connection number
Electronic Journal of Graph Theory and Applications, 2023 A rainbow path in an edge-colored graph G is a path that every two edges have different colors. The minimum number of colors needed to color the edges of G such that every two distinct vertices are connected by a rainbow path is called the rainbow ...
Rian Febrian Umbara +2 more
doaj +1 more source
Advanced Intelligent Systems, EarlyView.A piezoelectric meta‐transducer generates an ultrasonic rainbow, steering guided elastic waves to different angles according to frequency. A dithering‐based binary electrode design enables a closer realization of the target wavenumber filter, improving directional purity and suppressing unwanted lobes. Numerical and experimental validation demonstrates
Masoud Mohammadgholiha +5 more
wiley +1 more source
Rainbow separating path systems
Procedia Computer Science35 pages, 19 ...
Alexander Clifton +3 more
openaire +2 more sources
Lower bounds for rainbow Turán numbers of paths and other trees [PDF]
Australas. J Comb., 2019 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$. We show that $ex^*(n,P_k)\geq \frac{k}
Daniel Johnston, Puck Rombach
openaire +3 more sources
On the RACN of the comb product of the cycle C_3 with path P_n and broom Br_(n,m)
Journal Focus Action of Research MathematicThe combination of rainbow coloring and anti-magic labeling is known as Rainbow Antimagic Coloring (RAC). The Rainbow Antimagic Connection Number (RACN) of a graph G is the smallest number of colors induced by all edge weights under an antimagic labeling,
Brian Juned Septory +2 more
doaj +1 more source