Results 61 to 70 of about 1,117,749 (247)
(Strong) rainbow connection on the splitting of 3-path [PDF]
The rainbow connection number of a graph G, denoted rc(G), is the smallest number of colors needed to color the edges of G so that any two vertices are connected by a path whose edges all have different colors. Similarly we define the strong rainbow connection number of G, denoted by src(G), by replacing “path” with “geodesic”.
F. Septyanto, K. A. Sugeng
openaire +1 more source
Microbial communities and functional diversity in seafood
Abstract Functional diversity encompasses ecosystem processes that enhance adaptability to environmental change. This study explores the diversity of microorganisms associated with seafood. In this paper, we present our knowledge of microbial diversity in relation to seafood.
Christian Larbi Ayisi +3 more
wiley +1 more source
Beyond Group Outcomes: Gender‐Affirming Glottoplasty and Postoperative Voice Therapy
ABSTRACT Objective(s) To describe outcomes of gender‐affirming glottoplasty with adjunctive voice therapy in trans women and explore relationships between acoustic and patient‐reported measures of voice. Method A prospective, descriptive and exploratory study included 58 trans women undergoing glottoplasty performed and followed in a single ...
Nicole Free +5 more
wiley +1 more source
Engineering Photonic Pigments From Titania–Block Copolymer Composites
Ligand‐functionalized TiO2 nanoparticles selectively partition into P2VP‐rich lamellae of onion‐like PS‐b‐P2VP microspheres, increasing refractive index contrast while preserving concentric order through controlled self‐assembly. The resulting dry photonic pigments display defined Bragg reflections and angle‐robust structural color.
Niklas Rocca Schwarz +5 more
wiley +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
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
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
Rainbow Connection Number of Dense Graphs
An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to ...
Li Xueliang +2 more
doaj +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
ABSTRACT The Marias River flows from Glacier National Park through northcentral Montana, and into the Missouri River. Annual flows gradually declined from 1902 to 2024 (~3.2%/decade) and the 1952 Tiber Dam and Lake Elwell reservoir were operated to attenuate peak flows and stabilize downstream flows year‐round.
Stewart B. Rood, Lori A. Goater
wiley +1 more source

