نتایج جستجو برای: neighbourhood quality

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

Journal: :Revista de salud publica 2014
Beatriz Caicedo Kelvyn Jones

OBJECTIVE Structural and social neighbourhood constructs have been developed for studying a neighbourhood's influence on a variety of health outcomes; community surveys are being increasingly used for capturing such information. This paper has proposed a six-fold approach which integrates existing methodologies (i.e. multilevel factor analysis, ecometrics, multilevel spatial multiple membership...

2010
Sven Voigtländer Ursula Berger Oliver Razum

BACKGROUND There is increasing evidence that individual health is at least partly determined by neighbourhood and regional factors. Mechanisms, however, remain poorly understood, and evidence from Germany is scant. This study explores whether regional as well as neighbourhood deprivation are associated with physical health and to what extent this association can be explained by specific neighbo...

Journal: :Discussiones Mathematicae Graph Theory 2014
Igor Fabrici Jochen Harant Stanislav Jendrol Roman Soták

Given an integer valued weighting of all elements of a 2-connected plane graph G with vertex set V , let c(v) denote the sum of the weight of v ∈ V and of the weights of all edges and all faces incident with v. This vertex coloring of G is proper provided that c(u) 6= c(v) for any two adjacent vertices u and v of G. We show that for every 2-connected plane graph there is such a proper vertex co...

2006
Jyotirmoy Sarkar

Abstract: A particle moves among the vertices of an (m + 1)-gon which are labeled clockwise as 0, 1, . . . , m. The particle starts at 0 and thereafter at each step it moves to the adjacent vertex, going clockwise with a known probability p, or counterclockwise with probability 1 − p. The directions of successive movements are independent. What is the expected number of moves needed to visit al...

2012
Yujun Yang

A simple random walk on a graph is defined in which a particle moves from one vertex to any adjacent vertex, each with equal probability. The expected hitting time is the expected number of steps to get from one vertex to another before returning to the starting vertex. In this paper, using the electrical network approach, we provide explicit formulae for expected hitting times for simple rando...

Journal: :Ars Comb. 2012
Kris Coolsaet Peter D. Johnson Kenneth J. Roblee Tom D. Smotzer

We consider the class ER(n, d, λ) of edge-regular graphs for some n > d > λ, i.e., graphs regular of degree d on n vertices, with each pair of adjacent vertices having λ common neighbors. It has previously been shown that for such graphs with λ > 0 we have n ≥ 3(d − λ) and much has been done to characterize such graphs when equality holds. Here we show that n ≥ 3(d − λ) + 1 if λ > 0 and d is od...

Journal: :Discrete Applied Mathematics 2016
Gyula Y. Katona László F. Papp

A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move, one pebble each is removed at vertices v and w adjacent to a vertex u, and an extra pebble is added at vertex u. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that v...

Journal: :Australasian J. Combinatorics 2003
Mirka Miller Chris Rodger Rinovia Simanjuntak

As a natural extension of previously defined graph labelings, we introduce in this paper a new magic labeling whose evaluation is based on the neighbourhood of a vertex. We define a 1-vertex-magic vertex labeling of a graph with v vertices as a bijection f taking the vertices to the integers 1, 2, . . . , v with the property that there is a constant k such that at any vertex x, ∑ y∈N(x) f(y) = ...

Journal: :Discussiones Mathematicae Graph Theory 1997
Zsolt Tuza

Zsolt Tuza y Latest update : September 8, 1997 Abstract We survey the literature on those variants of the chromatic number problem where not only a proper coloring has to be found (i.e., adjacent vertices must not receive the same color) but some further local restrictions are imposed on the color assignment. Mostly, the list colorings and the precoloring extensions are considered. In one of th...

1997
Rupert Paget Dennis Longstaff

A method is proposed for obtaining the local clique set from a neighbourhood system. The Markov random field model, which is used extensively in image processing, is defined with respect to a neighbourhood system. The mathematical interpretation of the model is defined with respect to the corresponding clique set. We present a systematic method for extracting the complete local clique set from ...

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

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