Let G be a simple graph with vertex set {v1, v2, … , vn}. The common neighborhood graph of G, denoted by con(G), is a graph with vertex set {v1, v2, … , vn}, in which two vertices are adjacent if and only if they have at least one common neighbor in the graph G. In this paper, we compute the common neighborhood of some composite graphs. In continue, we investigate the relation between hamiltoni...

abstract the eu neighborhood policy is a road map that will depict the perspective of european :union:’s relations with its neighbors. the membership of the neighbors in the :union: is impossible, because they are confronted with deep domestic and foreign problems, and on the other hand eu’s security, political and economic interests in these countries lead to offering of the eu neighborhood po...

Considering a frame L, we introduce the notions of stratified L-semi-topological neighborhood group, stratified L-quasi-topological neighborhood group, and stratified L-quasi-bi-topological neighborhood group. In so doing, we look at the notion of stratified L-right (left) semi-topological neighborhood group, provide some basic facts, and present a construction of a stratified L-right semi-topo...

We introduce the notion of N-topo nilpotent fuzzy set in a fuzzy neighborhood ring and develop some fundamental results. Here we show that a fuzzy neighborhood ring is locally inversely bounded if and only if for all 0 < α < 1, the α-level topological rings are locally inversely bounded. This leads us to prove a characterization theorem which says that if a fuzzy neighborhood ring on a division...

Although sociodemographic factors are one aspect of understanding the effects of neighborhood environments on health, equating neighborhood quality with socioeconomic status ignores the important role of physical neighborhood attributes. Prior work on neighborhood environments and health has relied primarily on level of socioeconomic disadvantage as the indicator of neighborhood quality without...

Neighborhood based rough sets are important generalizations of the classical rough sets of Pawlak, as neighborhood operators generalize equivalence classes. In this article, we introduce nine neighborhood based operators and we study the partial order relations between twenty-two different neighborhood operators obtained from one covering. Seven neighborhood operators result in new rough set ap...

This paper studies whether, and how, parents respond to changing neighborhood quality through parental involvement. Empirical measurement of this response is complicated by neighborhood selection: through their residential location choices, parents have some control over neighborhood quality. To deal with neighborhood selection, I make use of the mass closures of public housing projects in Chic...

This paper considers the VRP Problem with Soft Time-Windows (VRPSTW), a challenging routing problem due to its combination of hard time windows and a lexicographic objective function minimizing the number of vehicles, the violations of the soft time windows, and the total travel distance. The paper presents a multi-stage, variable neighborhood search algorithm for the VRPSTW, which uses the sam...

Given a simple graph G, a set C ⊆ V (G) is a neighborhood cover set if every edge and vertex of G belongs to some G[v] with v ∈ C, where G[v] denotes the subgraph of G induced by the closed neighborhood of the vertex v. Two elements of E(G)∪V (G) are neighborhood-independent if there is no vertex v ∈ V (G) such that both elements are in G[v]. A set S ⊆ V (G) ∪ E(G) is neighborhood-independent i...