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

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

Journal: :Australasian J. Combinatorics 2016
Zheng-Jiang Xia Yong-Liang Pan Jun-Ming Xu

The pebbling number f(G) of a graphG is the least p such that, no matter how p 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 off one vertex and placing one on an adjacent vertex. It is conjectured that for all graphs G and H , we have f(G × H) ≤ f(G)f(H). If the graph G satisfies the odd 2-pebbling property, we w...

2017
Maarten van Ham Sanne Boschman Matt Vogel

APrIl 2017 IZA DP No. 10694 Incorporating Neighbourhood Choice in a Model of Neighbourhood Effects on Income Studies of neighbourhood effects often attempt to identify causal effects of neighbourhood characteristics on individual outcomes, such as income, education, employment, and health. However, selection looms large in this line of research and it has been repeatedly argued that estimates o...

Journal: :Discussiones Mathematicae Graph Theory 2014
Pablo De Caria Terry A. McKee

Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new characterizations. More intriguingly, these characterizations of chordal graphs can be naturally strengthened to new characterizations of strongly...

Journal: :Discrete Mathematics 1998
Saul Stahl

The Kneser graph K(m, n) has the n-subsets of {1, 2 . . . . . m} as its vertices, two such vertices being adjacent whenever they are disjoint. The kth multichromatic number of the graph G is the least integer t such that the vertices of G can be assigned k-subsets of {1, 2,... ,t}, so that adjacent vertices of G receive disjoint sets. The values of xk(K(m, n)) are computed for n = 2, 3 and boun...

Journal: :international journal of architectural engineering and urban planning 0
hossein khosravi tehran, enqelab square fariba gharai karaj shiva taghavi karaj

due to the change of lifestyle and improvement of public health the number of aged people has considerably increased. considering the relationship of the environment and people, the built environment features could exacerbate or facilitate the elderly people’s vulnerability and social needs. recently, a large number of studies have put emphasis on the relationship between the neighborhoods’ ope...

2017
Lina Hedman David Manley Maarten van Ham

IZA DP No. 11178 NOVEMBER 2017 Sorting out Neighbourhood Effects Using Sibling Data Previous research has reported evidence of intergenerational transmission of both neighbourhood status and social and economic outcomes later in life; parents influence where their children live as adults and how well they do later in life in terms of their income. However, interactions between the individual, t...

Journal: :محیط شناسی 0
منوچهر طبیبیان استاد دانشکده شهرسازی، پردیس هنرهای زیبای دانشگاه تهران یاسر منصوری کارشناس ارشد دانشکده شهرسازی، پردیس هنرهای زیبای دانشگاه تهران

introductionhistoric cities and neighbourhoods in iran couldn’t adjust themselves to quick changes of the recent decades andhave lost their quality in many aspects. regardless of different cultural, economic and social conditions, newneighbourhoods have been formed next to old areas of the cities. although these new areas welcom ed newfunctions, they couldn’t provide suitable environments for t...

Journal: :Discrete Mathematics 2008
Melody Chan Anant P. Godbole

Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing one pebble on an adjacent vertex. A distribution of pebbles on a graph is called solvable if it is possible to place a pebble on any given vertex using a sequence of pebbling steps. The pebbling number of a graph, denot...

Journal: :European Journal of Operational Research 2012
Carlile Lavor Leo Liberti Nelson Maculan Antonio Mucherino

The Molecular Distance Geometry Problem (MDGP) consists in finding an embedding in R of a nonnegatively weighted simple undirected graph with the property that the Euclidean distances between embedded adjacent vertices must be the same as the corresponding edge weights. The Discretizable Molecular Distance Geometry Problem (DMDGP) is a particular subset of the MDGP which can be solved using a d...

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

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