A glossary for the social epidemiology of work organization. Part 3: terms from labour markets

This is part 3 of a three-part glossary on the social epidemiology of work organisation. The first two parts deal with the social psychology of work and with organisations. This concluding part presents concepts related to labour markets. These concepts are drawn from economics, business and sociology. They relate both to traditional interests in these disciplines and to contemporary ideas on post-industrialisation and globalisation, particularly the growth of employment in service industries, the development of a 24-h economy, increased participation of the female labour force and the perceived needs of employers in emerging high-tech economies.These changes are of particular interest because they are linked to increasing inequality in earnings and changes in social relationships in employment. These concepts have the potential to elucidate the pathways through which health is affected by conditions of work as an underlying cause

Employment conditions and health inequalities.

Final Report to the WHO Commission on Social Determinants of Health (CSDH), Geneva

Recent studies on the super edge-magic deficiency of graphs

A graph $G$ is called edge-magic if there exists a bijective function $f:V\left(G\right) \cup E\left(G\right)\rightarrow \left\{1, 2, \ldots , \left\vert V\left( G\right) \right\vert +\left\vert E\left(G\right) \right\vert \right\}$ such that $f\left(u\right) + f\left(v\right) + f\left(uv\right)$ is a constant for each $uv\in E\left( G\right)$. Also, $G$ is called super edge-magic if $f\left(V \left(G\right)\right) =\left\{1, 2, \ldots , \left\vert V\left( G\right) \right\vert \right\}$. Furthermore, the super edge-magic deficiency $\mu_{s}\left(G\right)$ of a graph $G$ is defined to be either the smallest nonnegative integer $n$ with the property that $G \cup nK_{1}$ is super edge-magic or $+ \infty$ if there exists no such integer $n$. In this paper, we introduce the parameter $l\left(n\right)$ as the minimum size of a graph $G$ of order $n$ for which all graphs of order $n$ and size at least $l\left(n\right)$ have $\mu_{s} \left( G \right)=+\infty$, and provide lower and upper bounds for $l\left(n\right)$. Imran, Baig, and Fe\u{n}ov\u{c}\\u27{i}kov\\u27{a} established that for integers $n$ with $n\equiv 0\pmod{4}$, $\mu_{s}\left(D_{n}\right) \leq 3n/2-1$, where $D_{n}$ is the cartesian product of the cycle $C_{n}$ of order $n$ and the complete graph $K_{2}$ of order $2$. We improve this bound by showing that $\mu_{s}\left(D_{n}\right) \leq n+1$ when $n \geq 4$ is even. Enomoto, Llad\\u27{o}, Nakamigawa, and Ringel posed the conjecture that every nontrivial tree is super edge-magic. We propose a new approach to attack this conjecture. This approach may also help to resolve another labeling conjecture on trees by Graham and Sloane

Recent studies on the super edge-magic deficiency of graphs

A graph $G$ is called edge-magic if there exists a bijective function $f:V\left(G\right) \cup E\left(G\right)\rightarrow \left\{1, 2, \ldots , \left\vert V\left( G\right) \right\vert +\left\vert E\left( G\right) \right\vert \right\}$ such that $f\left(u\right) + f\left(v\right) + f\left(uv\right)$ is a constant for each $uv\in E\left( G\right)$. Also, $G$ is said to be super edge-magic if $f\left(V \left(G\right)\right) =\left\{1, 2, \ldots , \left\vert V\left( G\right) \right\vert \right\}$. Furthermore, the super edge-magic deficiency $\mu_{s}\left(G\right)$ of a graph $G$ is defined to be either the smallest nonnegative integer $n$ with the property that $G \cup nK_{1}$ is super edge-magic or $+ \infty$ if there exists no such integer $n$. In this paper, we introduce the parameter $l\left(n\right)$ as the minimum size of a graph $G$ of order $n$ for which all graphs of order $n$ and size at least $l\left(n\right)$ have $\mu_{s} \left( G \right)=+\infty$, and provide lower and upper bounds for $l\left(G\right)$. Imran, Baig, and Fe\u{n}ov\u{c}\'{i}kov\'{a} established that for integers $n$ with $n\equiv 0\pmod{4}$, $\mu_{s}\left(D_{n}\right) \leq 3n/2-1$, where $D_{n}$ is the cartesian product of the cycle $C_{n}$ of order $n$ and the complete graph $K_{2}$ of order $2$. We improve this bound by showing that $\mu_{s}\left(D_{n}\right) \leq n+1$ when $n \geq 4$ is even. Enomoto, Llad\'{o}, Nakamigawa, and Ringel posed the conjecture that every nontrivial tree is super edge-magic. We propose a new approach to attak this conjecture. This approach may also help to resolve another labeling conjecture on trees by Graham and Sloane