Results 41 to 50 of about 1,445 (260)
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
Vertex rainbow colorings of graphs
Discussiones Mathematicae Graph Theory, 2012 In a properly vertex-colored graph G, a path P is a rainbow path if no two vertices of P have the same color, except possibly the two end-vertices of P. If every two vertices of G are connected by a rainbow path, then G is vertex rainbow-connected. A proper vertex coloring of a connected graph G that results in a vertex rainbow-connected graph is a ...
Futaba Fujie-Okamoto +3 more
openaire +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
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
Journal of Combinatorics, 2011 Given a graph H, we denote by C(n,H) the minimum number k such that the following holds. There are n colorings of E(Kn) with k-colors, each associated with one of the vertices of Kn, such that for every copy T of H in Kn, at least one of the colorings that are associated with V (T ) assigns distinct colors to all the edges of E(T ). We characterize the
Alon, Noga, Ben-Eliezer, Ido
openaire +1 more source
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
MathematicsAn edge-coloring σ of a connected graph G is called rainbow if there exists a rainbow path connecting any pair of vertices. In contrast, σ is monochromatic if there is a monochromatic path between any two vertices.
Mohammed A. Mutar +2 more
doaj +1 more source
Animal Research and One Health, EarlyView.We conducted a longitudinal trial across nursery, growing, and finishing phases, showing that phytochemical supplementation as a potential antibiotic alternative reduced potential pathogens and promoted beneficial Lactobacillus amylovorus in the nursery phase, and enriched amino acid and carbohydrate metabolism pathways (prediction) during finishing ...
Ziyu Liu +11 more
wiley +1 more source
Theory and Applications of Graphs, 2022 Given an edge-colored complete graph Kn on n vertices, a perfect (respectively, near-perfect) matching M in Kn with an even (respectively, odd) number of vertices is rainbow if all edges have distinct colors.
Shuhei Saitoh, Naoki Matsumoto, Wei Wu
doaj +1 more source
Hardness of Rainbow Coloring Hypergraphs.
Electron. Colloquium Comput. Complex., 2017 A hypergraph is k-rainbow colorable if there exists a vertex coloring using k colors such that each hyperedge has all the k colors. Unlike usual hypergraph coloring, rainbow coloring becomes harder as the number of colors increases. This work studies the rainbow colorability of hypergraphs which are guaranteed to be nearly balanced rainbow colorable ...
Guruswami, Venkatesan, Saket, Rishi
openaire +4 more sources