Results 51 to 60 of about 2,084 (327)
On finding rainbow and colorful paths
Theoretical Computer Science, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lukasz Kowalik, Juho Lauri
openaire +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 PADA GRAF AMALGAMASI TANGGA SEGITIGA DIPERUMUM HOMOGEN
Jurnal Matematika UNAND, 2019 Untuk graf G terhubung dan tak trivial, dan k suatu bilangan bulat positif, misalkan c : E(G) → {1, 2, ..., k} suatu pewarnaan sisi di G, dimana sisi yang bertetangga boleh diberi warna yang sama. Suatu lintasan di G dikatakan lintasan rainbow jika tidak
Muhardiansyah Muhardiansyah +2 more
doaj +1 more source
Distance-Local Rainbow Connection Number
Discussiones Mathematicae Graph Theory, 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
Septyanto Fendy, Sugeng Kiki A.
doaj +1 more source
Barekeng, 2022 If be a graph and edge coloring of G is a function , rainbow connection number is the minimum-k coloration of the rainbow on the edge of graph G and denoted by rc(G). Rainbow connection numbers can be applied to the result of operations on some special
Sumarno Ismail +3 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
Desimal, 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 ...
Afifah Farhanah Akadji +3 more
doaj +1 more source
The Study of Rainbow Coloring of Graphs and Graph Coloring in Streaming.
, 2021 Graph coloring is a well known problem with wide-ranging applications. The vertex and edge coloring problems have been studied in various models of computation.
Upasana, Anannya
core
Spatial Engineering of Gas Diffusion Layers Overcomes Mass Transport Limitations in Fuel Cells
Advanced Science, EarlyView.ABSTRACT Mass transport limitations at high current densities hinder polymer electrolyte fuel cell (PEFC) performance due to inefficient water management and reactant distribution. Gas diffusion layer (GDL) perforation offers a potential solution as an alternative to complex flow‐field modifications.
Shangwei Zhou +12 more
wiley +1 more source
Microbial Odorant Detection Guides Drosophila Parasitoids Seeking Hosts in Fermenting Fruits
Advanced Science, EarlyView.Yeast microbes in fermenting fruits attract both host flies and their parasitoid wasps. Female Leptopilina boulardi detect yeast‐emitted ethyl esters via two olfactory receptors, LbouOR167 and LbouOR136. A conserved residue, Leu159, is critical for binding these compounds, enabling female wasps to locate host‐rich habitats.
Yueqi Lu +11 more
wiley +1 more source