UNLABELLED Yersinia ruckeri is the etiological agent of enteric redmouth (ERM) disease of farmed salmonids. Enteric redmouth disease is traditionally associated with rainbow trout (Oncorhynchus mykiss, Walbaum), but its incidence in Atlantic salmon (Salmo salar) is increasing. Yersinia ruckeri isolates recovered from diseased Atlantic salmon have been poorly characterized, and very little is kn...

Cardiac tissue from female rainbow trout demonstrates a sex-specific preference for exogenous glucose and glycolysis, impaired Ca(2+) handling, and a greater tolerance for hypoxia and reoxygenation than cardiac tissue from male rainbow trout. We tested the hypothesis that dichloroacetate (DCA), an activator of pyruvate dehydrogenase, enhances cardiac energy metabolism and Ca(2+) handling in fem...

A dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex in V \D has at least one neighbour in D. Moreover if D is an independent set, i.e. no vertices in D are pairwise adjacent, then D is said to be an independent dominating set. Finding a minimum independent dominating set in a graph is an NP-hard problem. We give an algorithm computing a minimum independent dom...

We study the existence and the number of k-dominating independent sets in certain graph families. While the case k = 1 namely the case of maximal independent sets which is originated from Erdős and Moser is widely investigated, much less is known in general. In this paper we settle the question for trees and prove that the maximum number of kdominating independent sets in n-vertex graphs is bet...

Let $G$ be a simple graph with vertex set $V$. A double Roman dominating function (DRDF) on $G$ is a function $f:Vrightarrow{0,1,2,3}$ satisfying that if $f(v)=0$, then the vertex $v$ must be adjacent to at least two vertices assigned $2$ or one vertex assigned $3$ under $f$, whereas if $f(v)=1$, then the vertex $v$ must be adjacent to at least one vertex assigned $2$ or $3$. The weight of a DR...

A path in an edge-colored graph is called a rainbow path if the edges on it have distinct colors. For k ≥ 1, the rainbow-k-connectivity of a graph G, denoted rck(G), is the minimum number of colors required to color the edges of G in such a way that every two distinct vertices are connected by at least k internally vertex-disjoint rainbow paths. In this paper, we study rainbow-k-connectivity in...