Results 51 to 60 of about 650 (167)

Infectious hematopoietic necrosis virus (IHNV) in fish and its consequences for fish farming: A comprehensive review

Journal of the World Aquaculture Society, Volume 57, Issue 3, June 2026.
Abstract Viral diseases are a major concern in finfish aquaculture, leading to severe health problems. Infectious hematopoietic necrosis (IHN) is a highly transmissible systemic viral disease that primarily affects salmonids, causing significant mortality and economic losses to the salmonid farming industry.
Zahra Tulaby Dezfuly, Amin Marandi, Marzieh Abbasi, Masoumeh Bashiri, Arash Ghalyanchilangeroudi, Zahra Ziafati Kafi, Mohammad Jalil Zorriehzahra, Leila Aghaiyan, Louise von Gersdorff Jørgensen, Hooman Rahmati‐Holasoo   +9 more
wiley   +1 more source

Vertex rainbow colorings of graphs

, 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.
Fujie-Okamoto, Futaba, Kolasinski, Kyle, Lin, Jianwei, Zhang, Ping   +3 more
core   +1 more source

Morphology and Distribution of Olfactory Receptor Neurons in Southern Bluefin Tuna, Thunnus maccoyii (Teleostei): Implications for Olfactory Hydrodynamics

Journal of Morphology, Volume 287, Issue 5, May 2026.
The number and distribution of olfactory receptors over the olfactory lamellar surface of four juvenile southern bluefin tuna were quantified using scanning electron microscopy. The microvillous olfactory receptors (mORN) are concentrated in the rostral region of the lamellar surface, while ciliated olfactory receptors (cORN), which are dominant in ...
Myoung‐Hoon Ha, Lucille Chapuis, Travis L. Dutka, Julian Pepperell, Caroline C. Kerr, Shaun P. Collin   +5 more
wiley   +1 more source

Rainbow Connection Number dan Strong Rainbow Connection Number pada Graf komplemen dari Graf konjugasi grup dihedral [PDF]

, 2017
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  

Performance and Health Status of Juvenile Largemouth Bass (Micropterus nigricans) Fed Inclusions of Enzyme‐Treated and Low‐Oligosaccharide Soy Proteins

Aquaculture, Fish and Fisheries, Volume 6, Issue 2, April 2026.
ABSTRACT Plant‐based proteins, such as soybean meal (SBM), have shown promising results in cultured species but also present challenges due to their nutrient composition and inherent antinutritional factors. This study investigated how the replacement of solvent‐extracted SBM with low oligosaccharide soybean meal (LSBM) or enzyme‐treated soybean meal ...
Jamison L. Semla, Chia‐Tsen Chiang, Trinh H. V. Ngo, D. Allen Davis, Ian A. E. Butts, Alvin C. Camus, Benjamin R. LaFrentz, Timothy J. Bruce   +7 more
wiley   +1 more source

Bilangan rainbow connection dari hasil operasi penjumlahan dan perkalian kartesius dua graf [PDF]

, 2012
INDONESIA: Graf G dengan pewarnaan sisi disebut pelangi sisi terhubung, jika setiap titik pada graf G dihubungkan oleh lintasan yang memiliki sisi-sisi dengan warna yang berbeda.
Fuad Adi Saputra, Saputra, Fuad Adi
core   +1 more source

Cochlear Implantation and Facial Nerve Stimulation: Clinical and Anatomic Correlations

The Laryngoscope, Volume 136, Issue 3, Page 1193-1203, March 2026.
One rare complication of cochlear implantation (CI) is facial nerve stimulation (FNS) and in this study the location and insertion depths for electrode contacts causing FNS was analyzed, and the anatomical variance of the human facial nerve canal (FNC) was explored to elucidate the mechanisms underlying FNS.
Karin Hallin, Sumit Agrawal, Hanif M. Ladak, Helge Rask‐Andersen, Hao Li   +4 more
wiley   +1 more source

Proper Rainbow Connection Number of Graphs

, 2021
A path in an edge-coloured graph is called a rainbow path if its edges receive pairwise distinct colours. An edge-coloured graph is said to be rainbow connected if any two distinct vertices of the graph are connected by a rainbow path.
Schiermeyer Ingo, Doan Trung Duy
core   +1 more source

A new taxon of saurischian dinosaur from the Coelophysis Quarry of New Mexico, USA (Triassic: latest Norian or Rhaetian) highlights herrerasaurian diversity in the latest Triassic

Papers in Palaeontology, Volume 12, Issue 2, March/April 2026.
Abstract The most complete record of the earliest dinosaur lineages is from the Carnian from the higher latitudes of Pangea (e.g. present‐day Brazil, Argentina), but dinosaurian assemblages from the upper stages of the Upper Triassic are better known from the low latitudes of Pangea (present day southwestern USA).
Simba Srivastava, Sterling J. Nesbitt
wiley   +1 more source

ANALISIS RAINBOW VERTEX CONNECTION PADA BEBERAPA GRAF KHUSUS DAN OPERASINYA

, 2016
Salah satu teori yang dikembangkan dalam teori graf adalah rainbow connection. Teori rainbow connection dikembangkan menjadi 2 jenis yaitu rain- bow edge connection yang biasa disebut rainbow connection dan rainbow vertex connection.
ARISKA, Ida
core   +1 more source