Results 71 to 80 of about 112,754 (257)
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
Simultaneous Network Design With Restricted Link Usage
ABSTRACT Given a digraph with two terminal vertices s$$ s $$ and t$$ t $$ as well as a conservative cost function and several not necessarily disjoint color classes on its arc set, our goal is to find a minimum‐cost subset of the arcs such that its intersection with each color class contains an s$$ s $$‐t$$ t $$ dipath.
Naonori Kakimura +3 more
wiley +1 more source
Rainbow Connection Number of Graphs with Diameter 3
A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every pair of distinct vertices of G
Li Hengzhe, Li Xueliang, Sun Yuefang
doaj +1 more source
Resilience‐as‐doing: A relational model for living practice
Abstract Dominant frameworks treat resilience as a capacity to withstand disturbance and recover, something systems, communities or individuals either have or lack. This paper proposes a different understanding, grounded in relational onto‐epistemology and first‐person, practice‐based, autoethnographic inquiry situated within a household garden.
Katie Moon
wiley +1 more source
Relational knowing as method and practice
Abstract This paper seeks to contribute to (re)building the capacity for embodied, place‐based relational knowing, transforming how we know and thus what we know. What is known, or sought to be known, is relations. How we know these relations is by already being in it: breathing, sensing, moving, listening, responding, affecting and being affected ...
Katie Moon
wiley +1 more source
Rainbow connection number of corona product of graphs
In an edge-colored graph (where adjacent edges may have the same color), a rainbow path is a path whose edge colors are all distinct. The coloring is called a rainbow coloring if any two vertices can be connected by a rainbow path. The rainbow connection
Fendy Septyanto
doaj +1 more source
Cross‐Platform Comparison of Chemoproteomics Workflows: Orbitrap‐TMT Versus timsTOF‐diaPASEF
ABSTRACT Chemoproteomics aims to achieve precise and comprehensive quantification of protein–small molecule interactions, yet methodological comparisons across quantitative proteomics workflows remain scarce. Here, we systematically benchmark tandem mass tag data‐dependent acquisition (TMT‐DDA) on Orbitrap Exploris/Eclipse instruments against label ...
Ursula M. Glocker +7 more
wiley +1 more source
Generalized Rainbow Connection of Graphs and their Complements
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
ABSTRACT Artificial protein design enables the creation of stable scaffolds beyond those evolved in nature. Incorporation of native functional motifs into de novo scaffolds provides a promising strategy to mimic natural interactions while altering structural frameworks.
Hakuto Miyoshi +7 more
wiley +1 more source
ABSTRACT Rationale Ions trapped within a Penning cell (ICR) travel periodic orbits whose frequencies are dependent on their mass‐to‐charge ratio and the value of the magnetic field passing through the trap. Fourier transformation (FT‐ICR) decomposes the signal induced in the detection circuit by the rotation of the ions in the cell after the ...
Patrick Arpino, Michel Heninger
wiley +1 more source

