A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs

The \emph{zero forcing number}, $Z(G)$, of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G)-S$ are colored white) such that $V(G)$ is turned black after finitely many applications of "the color-change rule": a white vertex is converted black if it is the only white neighbor of a black vertex. The \emph{strong metric dimension}, $sdim(G)$, of a graph $G$ is the minimum among cardinalities of all strong resolving sets: $W \subseteq V(G)$ is a \emph{strong resolving set} of $G$ if for any $u, v \in V(G)$, there exists an $x \in W$ such that either $u$ lies on an $x-v$ geodesic or $v$ lies on an $x-u$ geodesic. In this paper, we prove that $Z(G) \le sdim(G)+3r(G)$ for a connected graph $G$, where $r(G)$ is the cycle rank of $G$. Further, we prove the sharp bound $Z(G) \leq sdim(G)$ when $G$ is a tree or a unicyclic graph, and we characterize trees $T$ attaining $Z(T)=sdim(T)$. It is easy to see that $sdim(T+e)-sdim(T)$ can be arbitrarily large for a tree $T$; we prove that $sdim(T+e) \ge sdim(T)-2$ and show that the bound is sharp.Comment: 8 pages, 5 figure

Perceptions of, and reactions to, environmental heat: a brief note on issues of concern in relation to occupational health

Average temperatures around the world are already increasing, and climate change projections suggest that global mean temperatures will continue to rise. As the effects, and projected effects, of climate change are becoming clearer, it is more apparent that the health effects of heat exposure will need further investigation. The risks associated with heat exposure are especially relevant to understandings of occupational health for people involved in labouring or agricultural work in low-income countries. This review is a partial look at the ways in which issues surrounding heat exposure and occupational health have been treated in some of the available literature. This literature focuses on military-related medical understandings of heat exposure as well as heat exposure in working environments. The ways that these issues have been treated throughout the literature reflect the ways in which technologies of observation are intertwined with social attitudes. The effects of heat on the health of working people, as well as identification of risk groups, will require further research in order to promote prophylactic measures as well as to add to understandings of the actual and potential consequences of climatic change

Parameterization of a coarse-grained model of cholesterol with point-dipole electrostatics

© 2018, Springer Nature Switzerland AG. We present a new coarse-grained (CG) model of cholesterol (CHOL) for the electrostatic-based ELBA force field. A distinguishing feature of our CHOL model is that the electrostatics is modeled by an explicit point dipole which interacts through an ideal vacuum permittivity. The CHOL model parameters were optimized in a systematic fashion, reproducing the electrostatic and nonpolar partitioning free energies of CHOL in lipid/water mixtures predicted by full-detailed atomistic molecular dynamics simulations. The CHOL model has been validated by comparison to structural, dynamic and thermodynamic properties with experimental and atomistic simulation reference data. The simulation of binary DPPC/cholesterol mixtures covering the relevant biological content of CHOL in mammalian membranes is shown to correctly predict the main lipid behavior as observed experimentally

On the Power Domination Number of de Bruijn and Kautz Digraphs

Let G=(V,A) be a directed graph, and let S⊆V be a set of vertices. Let the sequence S=S₀⊆S₁⊆S₂⊆⋯ be defined as follows: S₁ is obtained from S₀ by adding all out-neighbors of vertices in S₀. For k⩾2, Sₖ is obtained from Sₖ₋₁ by adding all vertices w such that for some vertex v∈Sₖ₋₁, w is the unique out-neighbor of v in V∖Sₖ₋₁. We set M(S)=S₀∪S₁∪⋯, and call S a power dominating set for G if M(S)=V(G). The minimum cardinality of such a set is called the power domination number of G. In this paper, we determine the power domination numbers of de Bruijn and Kautz digraphs