Results 51 to 60 of about 5,748 (282)
Rainbow Connectivity of Cacti and of Some Infinite Digraphs
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
BILANGAN RAINBOW CONNECTION DAN STRONG RAINBOW CONNECTION GRAF JAHANGIR J2,m UNTUK 2 ≤ m ≤ 8
Misalkan G adalah graf terhubung tak trivial dan didefinisikan pewarnaansisi pada graf G, yaitu p : E(G) → {1, 2, ..., n}; n ∈ N, dimana sisi yang bertetanggaboleh bewarna sama.
DES WELYYANTI +2 more
doaj +1 more source
The rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi +3 more
doaj +1 more source
Rainbow connection number of comb product of graphs
An edge-colored graph G is called a rainbow connected if any two vertices are connected by a path whose edges have distinct colors. Such a path is called a rainbow path.
Dinny Fitriani +2 more
doaj +1 more source
Microbial Odorant Detection Guides Drosophila Parasitoids Seeking Hosts in Fermenting Fruits
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
Deep Learning‐Assisted Coherent Raman Scattering Microscopy
The analytical capabilities of coherent Raman scattering microscopy are augmented through deep learning integration. This synergistic paradigm improves fundamental performance via denoising, deconvolution, and hyperspectral unmixing. Concurrently, it enhances downstream image analysis including subcellular localization, virtual staining, and clinical ...
Jianlin Liu +4 more
wiley +1 more source
Rainbow connection number of amalgamation of some graphs
Let G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the edges of G such that adjacent edges can be colored the same. A path P in G is a rainbow path if no two edges of P are colored the same. A rainbow path connecting
D. Fitriani, A.N.M. Salman
doaj +1 more source
Rainbow Connection Number dan Strong Rainbow Connection Number pada Graf komplemen dari Graf konjugasi grup dihedral [PDF]
INDONESIA: Graf G dengan pewarnaan sisi disebut rainbow connected jika setiap titik pada graf G dihubungkan oleh lintasan yang memiliki sisi-sisi dengan warna berbeda.
Indahsari, Alvi Nur Laila
core
Human‐in‐the‐Loop Object Segmentation for 3D Gaussian Splatting via Finger‐based VR Interface
This study introduces a human‐in‐the‐loop segmentation framework for 3D Gaussian Splatting that integrates real‐time optimization with intuitive VR‐based finger prompting. Compared with existing automatic, learning‐based methods, it achieves significantly higher accuracy and reduced segmentation time.
Yongseok Lee +5 more
wiley +1 more source
EMG‐Driven Telemetry and Inference System for Fish: Pose Reconstruction and Flow Sensing
This work introduces an electromyography (EMG)‐driven telemetry framework that reconstructs body pose and infers hydrodynamic conditions in freely swimming fish. A custom 16‐channel archival system records intramuscular EMG, enabling deep‐learning models to decode joint kinematics, classify flow regimes, and reveal channel‐efficient sensing strategies.
Rahdar Hussain Afridi +7 more
wiley +1 more source

