This study aimed to explore whether individual cognitions and neighbourhood social capital strengthen each other in their relation with engaging in sports at least three times per week. Cross-sectional analyses on data from the last wave of the YouRAction trial (2009-2010, Rotterdam, the Netherlands; baseline response: 98%) were conducted. In total 1129 had data on the last wave questionnaire (...

This paper deals with the numerical modelling of corona discharges induced by electrohydrodynamic actuators. A specific numerical method is proposed and discussed to compute the multiscale nature observed in the modelling of corona discharges. The idea consists in a domain decomposition of the computational domain where each subdomain is described with a specific modelling well adapted to the p...

BACKGROUND Health and conditions for health are unevenly distributed across neighbourhoods. Within a salutogenic perspective, neighbourhood-resources can be internalised, and become generalised resistance resources. This paper aims to examine whether the neighbourhood could be a supportive arena for health-promotion, and for whom. DESIGN AND METHODS A cross-sectional study, based on register ...

let $g=(v,e)$ be a‎ ‎simple graph of order $n$ and size $m$‎. ‎an $r$-matching of $g$ is ‎a set of $r$ edges of $g$ which no two of them have common vertex‎. ‎the hosoya index $z(g)$ of a graph $g$ is defined as the total‎ ‎number of its matchings‎. ‎an independent set of $g$ is a set of‎ ‎vertices where no two vertices are adjacent‎. ‎the ‎merrifield-simmons index of $g$ is defined as the tota...

OBJECTIVES Few studies have explored the impact of neighbourhood socioeconomic status (SES) on health behaviours in youths in Germany. Our aim was to investigate the association of individual and neighbourhood SES with physical activity (PA) and screen time (ST) in students aged 12-13 years in Berlin. DESIGN Cross-sectional study. SETTING Secondary schools (high schools and integrated secon...

Given a positive integer n we find a graph G = (V,E) on |V | = n vertices with a minimum number of edges such that for any pair of non adjacent vertices x, y the graph G − x − y contains a (almost) perfect matching M . Intuitively the non edge xy and M form a (almost) perfect matching of G. Similarly we determine a graph G = (V,E) with a minimum number of edges such that for any matching M̄ of t...

The pebbling number of a graph G, f(G), is the least m such that, however m pebbles are placed on the vertices of G, we can move a pebble to any vertex by a sequence of moves, each move taking two pebbles o one vertex and placing one on an adjacent vertex. It is conjectured that for all graphs G and H , f(G H) f(G)f(H). Let Cm and Cn be cycles. We prove that f(Cm Cn) f(Cm)f(Cn) for all but a ni...

A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to the set of colours appearing on the edges incident with w. Let ndi(G) be the least number of colours required for a proper neighbour-distinguishing edge colouring of G. We prove that for d ≥ 4, a random d-regular grap...

Temperature inversions occur in nature, e.g., in the solar corona and in interstellar molecular clouds: Somewhat counterintuitively, denser parts of the system are colder than dilute ones. We propose a simple and appealing way to spontaneously generate temperature inversions in systems with long-range interactions, by preparing them in inhomogeneous thermal equilibrium states and then applying ...