نتایج جستجو برای: maximal 2 rainbow dominating function

تعداد نتایج: 3519966  

Journal: :Applied optics 1994
J A Lock J M Jamison C Y Lin

We examine the behavior of the first-order rainbow for a coated sphere by using both ray theory and Aden-Kerker wave theory as the radius of the core a(12) and the thickness of the coating δ are varied. As the ratio δ/a(12) increases from 10(-4) to 0.33, we find three classes of rainbow phenomena that cannot occur for a homogeneous-sphere rainbow. For δ/a(12) ≲ 10(-3), the rainbow intensity is ...

2014
Kenneth J. Rodnick

Dichloroacetate selectively improves cardiac function and metabolism in female and male rainbow 1 trout 2 3 Pavan K. Battiprolu* and Kenneth J. Rodnick 4 5 6 Department of Biological Sciences, Idaho State University, Pocatello, ID 83209-8007 7 8 *Current address: Department of Metabolic disorders, Amgen, Inc. South San Francisco, CA 94568. 9 10 Corresponding author. e-mail: [email protected]; ph...

‎‎Let $G=(V‎, ‎E)$ be a simple graph with vertex set $V$ and edge set $E$‎. ‎A {em mixed Roman dominating function} (MRDF) of $G$ is a function $f:Vcup Erightarrow {0,1,2}$ satisfying the condition that every element $xin Vcup E$ for which $f(x)=0$ is adjacent‎‎or incident to at least one element $yin Vcup E$ for which $f(y)=2$‎. ‎The weight of an‎‎MRDF $f$ is $sum _{xin Vcup E} f(x)$‎. ‎The mi...

Mayamma Joseph, S.R. Shreyas

If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.

Journal: :CoRR 2017
Paul Dorbec Antonio González Claire Pennarun

Power domination in graphs emerged from the problem of monitoring an electrical system by placing as few measurement devices in the system as possible. It corresponds to a variant of domination that includes the possibility of propagation. For measurement devices placed on a set S of vertices of a graph G, the set of monitored vertices is initially the set S together with all its neighbors. The...

2005
Mathieu Liedloff Ton Kloks Jiping Liu Sheng-Lung Peng

A Roman dominating function of a graph G = (V,E) is a function f : V → {0, 1, 2} such that every vertex x with f(x) = 0 is adjacent to at least one vertex y with f(y) = 2. The weight of a Roman dominating function is defined to be f(V ) = P x∈V f(x), and the minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G. In this paper we answer an open pro...

Journal: :American journal of physiology. Regulatory, integrative and comparative physiology 2014
Teye Omlin Karolanne Langevin Jean-Michel Weber

Intense swimming causes circulatory lactate accumulation in rainbow trout because lactate disposal (Rd) is not stimulated as strongly as lactate appearance (Ra). This mismatch suggests that maximal Rd is limited by tissue capacity to metabolize lactate. This study uses exogenous lactate to investigate what constrains maximal Rd and minimal Ra. Our goals were to determine how exogenous lactate a...

2013
Wen-Sheng Li Hua-Ming Xing Moo Young Sohn YOUNG SOHN

Let G = (V, E) be a graph. A function f : V → {−1,+1} defined on the vertices of G is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. The signed total domination number of G, γ t (G), is the minimum weight of a signed total dominating function of G. In this paper, we study the signed total domination number of generalized Petersen...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید