Results 71 to 80 of about 650 (167)

Evaluation of a novel anti‐mycotoxin agent specific for aquatic species in mitigating aflatoxin B1‐induced changes in Nile tilapia: A comprehensive study

Journal of the World Aquaculture Society, Volume 57, Issue 1, February 2026.
Abstract Aflatoxin B1 (AFB1) contamination of aquaculture feed poses serious health risks to fish and consumers. In this study, the efficacy of a novel anti‐mycotoxin agent specific for aquatic species (AM‐AQ) containing bentonite, sepiolite, and orange peel meal (Citrus Sinensis) in alleviating AFB1 toxicity in Nile tilapia (Oreochromis niloticus) was
Eman Zahran, Samia Elbahnaswy, Fatma Abdelhamid, Shaaban M. Abdel‐Fattah, Ahmed I. A. Mansour, Iman Ibrahim, Fatma Ahmed, Walaa El‐Houseiny, Eva León, Raquel Codina, Óscar Castro, Insaf Riahi, Zeinab Hassan   +12 more
wiley   +1 more source

Rainbow connection number of corona product of graphs

Electronic Journal of Graph Theory and Applications
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

Characterizing the Lanthanide‐Binding Tag Grafted at Calmodulin Site 1: Affinity, Selectivity, and Coordination Properties

European Journal of Inorganic Chemistry, Volume 29, Issue 3, January 21, 2026.
Lanthanide affinity and selectivity in proteins remain poorly understood. Engineering calmodulin with a lanthanide‐binding tag at Site 1 boosts affinity from nanomolar (isolated LBTs) to picomolar dissociation constants, comparable to lanmodulin but with distinct selectivity.
Catherine Berthomieu, Manon Martin, Jean Aupiais, Tiffanie Barré, Loïc Daronnat, Jérémy Pansier, Nicolas Brémond, David Lemaire, Atul Thawari, Martin Levier, Laurence Berthon, Sandrine Sauge‐Merle   +11 more
wiley   +1 more source

Total Rainbow Connection Number Of Shackle Product Of Antiprism Graph (〖AP〗_3)

, 2023
Function if  is said to be k total rainbows in , for each pair of vertex  there is a path called  with each edge and each vertex on the path will have a different color.
Payu, Muhammad Rezky Friesta, Huntala, Melisa, Yahya, Nisky Imansyah   +2 more
core   +1 more source

Penentuan Rainbow Connection Number dan Strong Rainbow Connection Number pada Graf berlian. [PDF]

, 2017
Misalkan G = (V,E) adalah suatu graf. Suatu pewarnaan c : E(G) → {1,2,...,k}, k ∈ N pada graf G adalah suatu pewarnaan sisi di G sedemikian sehingga setiap sisi bertetangga boleh berwarna sama.
Suci, Riezsa Dessyluviani
core  

Graphs with rainbow connection number two

, 2011
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order ...
Kemnitz, Arnfried, Schiermeyer, Ingo
core   +1 more source

The rainbow vertex-index of complementary graphs

, 2015
A vertex-colored graph $G$ is \emph{rainbow vertex-connected} if two vertices are connected by a path whose internal vertices have distinct colors. The \emph{rainbow vertex-connection number} of a connected graph $G$, denoted by $rvc(G)$, is the smallest
Ye, Chengfu, Wang, Zhao, Zhang, Shumin, Yanling, Fengnan   +3 more
core  

The n-queens completion problem. [PDF]

Res Math Sci, 2022
Glock S, Munhá Correia D, Sudakov B.
europepmc   +1 more source

Determining the Locating Rainbow Connection Number of Vertex-Transitive Graphs

The locating rainbow connection number of a graph is defined as the minimum number of colors required to color vertices such that every two vertices there exists a rainbow vertex path and every vertex has a distinct rainbow code.
Putri, Pritta Etriana, Salman, ANM, Bustan, Ariestha Widyastuty   +2 more
core  

Rainbow Connection Number Pada Operasi Graf

, 2014
An edge-colouring of a graph $G$ is rainbow connected if  there are $k$ internally vertex-disjoint paths joining them, with no two edges on the path have the same color.
Yulianti S, Arnasyitha, Dafik, Dafik
core