Results 41 to 50 of about 4,433 (166)
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
Generalized Rainbow Connection of Graphs and their Complements
Discussiones Mathematicae Graph Theory, 2018 Let G be an edge-colored connected graph. A path P in G is called ℓ-rainbow if each subpath of length at most ℓ + 1 is rainbow. The graph G is called (k, ℓ)-rainbow connected if there is an edge-coloring such that every pair of distinct vertices of G is ...
Li Xueliang +3 more
doaj +1 more source
On the study of Rainbow Antimagic Coloring of Special Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . The bijective function is said to be a labeling of graph where is the associated weight for edge .
Dafik Dafik +3 more
doaj +1 more source
Rainbow Connectivity of Cacti and of Some Infinite Digraphs
Discussiones Mathematicae Graph Theory, 2017 An arc-coloured digraph D = (V,A) is said to be rainbow connected if for every pair {u, v} ⊆ V there is a directed uv-path all whose arcs have different colours and a directed vu-path all whose arcs have different colours.
Alva-Samos Jesús +1 more
doaj +1 more source
Rainbow Vertex-Connection Number [PDF]
, 2012 All the above parameters on rainbow connections involved edge-colorings of graphs. A natural idea is to introduce a similar parameter involving vertex-colorings of graphs. It is, as mentioned above, a vertex version of the rainbow connection number. Krivelevich and Yuster (J.
Xueliang Li, Yuefang Sun
openaire +1 more source
Strong rainbow connection numbers of toroidal meshes [PDF]
Discrete Mathematics, Algorithms and Applications, 2018 In 2011, Li et al. [The (strong) rainbow connection numbers of Cayley graphs on Abelian groups, Comput. Math. Appl. 62(11) (2011) 4082–4088] obtained an upper bound of the strong rainbow connection number of an [Formula: see text]-dimensional undirected toroidal mesh. In this paper, this bound is improved.
Yulong Wei, Min Xu 0005, Kaishun Wang
openaire +2 more sources
On Proper (Strong) Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored graph G is called a rainbow path if no two edges on the path have the same color. The graph G is called rainbow connected if between every pair of distinct vertices of G, there is a rainbow path.
Jiang Hui +3 more
doaj +1 more source
FEBS Open Bio, EarlyView.The presence of biotin‐binding avidin proteins in fish and their biological significance are poorly characterized. We cataloged fish avidins and demonstrate that they are widely present and evolutionarily conserved. We created avd knockout zebrafish and show that zebavidin is dispensable for development and that resistance of avd knockout embryos in ...
Anni K. Saralahti +5 more
wiley +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
Advanced Engineering Materials, EarlyView.This article presents the design, modeling, and characterization of air‐pressure–actuated programmable vibroacoustic metamaterials (PVAMM). The study focuses on leveraging air pressure to dynamically tune resonance frequencies for effective noise attenuation.
William Kaal +2 more
wiley +1 more source