Skip to search formSkip to main contentSkip to account menu

Neighbourhood (graph theory)

Known as: Neighborhood (graph theory), Adjacent vertices, Adjacent vertex 
In graph theory, an adjacent vertex of a vertex v in a graph is a vertex that is connected to v by an edge. The neighbourhood of a vertex v in a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We investigate an integrated inventory routing problem (IRP) in which one supplier with limited production capacity distributes a… 
2012
2012
We deal with the Copenhagen problem where the two big bodies of equal masses are also magnetic dipoles and we study some aspects… 
2004
2004
This study examined how forest edges, fruit display size, and fruit colour influenced rates of seed dispersal in an endemic, bird… 
2003
2003
Congruence closure algorithms for deduction in ground equational theories are ubiquitous in many (semi-)decision procedures used… 
Highly Cited
1996
Highly Cited
1996
SUMMARY We propose a new optimization strategy for unstructured meshes that, when coupled with existing automatic generators… 
1993
1993
The global behaviour of a granular flow is critically dependent on its interaction with whatever solid boundaries with which it… 
1990
1990
  • H. Hind
  • 1990
  • Corpus ID: 14684268
AbstractThe total chromatic number,χ″(G), of a graphG, is defined to be the minimum number of colours needed to colour the… 
1985
1985
Neighbourhoods in natural populations of Primula vulgaris were found to be small, with neighbourhood sizes ranging from 1 to 38… 
1958
1958
DESPITE the fact that the observation of an artificial satellite can be carried out only on a small region of the Earth's surface…