Results 101 to 110 of about 2,084 (327)
BarekengThe 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
River Research and Applications, EarlyView.ABSTRACT Florida's regulatory framework requires the establishment of minimum flows to protect aquatic ecosystems and water resources from significant harm. One of the primary methods used to evaluate significant harm is assessment of instream habitat, which relies on Habitat Suitability Criteria (HSC) curves that relate flow regimes and habitat ...
Eric J. Nagid, Kym Rouse Holzwart
wiley +1 more source
Rainbow Connection Number of Graphs with Diameter 3
Discussiones Mathematicae Graph Theory, 2017 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
River Research and Applications, EarlyView.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
Big Bird: A global dataset of birds in drone imagery annotated to species level
Remote Sensing in Ecology and Conservation, EarlyView.Drones are a valuable tool for surveying birds, but manually detecting and identifying birds in drone images is costly. We assembled a diverse dataset of 23 865 images of birds captured with 21 different drones across 11 countries. We labelled 4824 of these images, detailing the location, species, posture category, age category, and sex of 49 990 birds
Joshua P. Wilson +19 more
wiley +1 more source
Rainbow mean colorings of graphs
Discrete Mathematics Letters, 2019 Summary: A mean coloring of a connected graph \(G\) of order 3 or more is an edge coloring \(c\) of \(G\) with positive integers where the average of the colors of the edges incident with each vertex \(v\) of \(G\) is an integer. This average is the chromatic mean of \(v\).
Gary Chartrand +3 more
openaire +2 more sources
Optical‐controlled magnon transport based on spin crossover switched molecular magnets
Smart Molecules, EarlyView.A cyanide‐bridged W(V)–Fe(II) spin‐crossover single crystal was integrated into a magnon transport device, enabling reversible optical control of magnon transport through photo‐switched spin states. Abstract Molecule‐based devices that combine the advantages of fast time response and extremely low manipulation/transmission energy consumption of light ...
Yu‐Jing Gao +5 more
wiley +1 more source
The Changing Character of Carbon in Fluids with Pressure
Geophysical Monograph Series, Page 259-269., 2020 This book is Open Access. A digital copy can be downloaded for free from Wiley Online Library.
Explores the behavior of carbon in minerals, melts, and fluids under extreme conditions
Carbon trapped in diamonds and carbonate-bearing rocks in subduction zones are examples of the continuing exchange of substantial carbon ...
Dimitri Sverjensky +2 more
wiley +2 more sources
Rainbow connection number of corona product of graphs
Electronic Journal of Graph Theory and ApplicationsIn 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
Generalized Rainbow Connection of Graphs and their Complements
Discussiones Mathematicae Graph Theory, 2018 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