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)

Related topics

Related topics

35 relations
Adjacency listAdjacency matrixBipartite double coverClaw-free graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Evolutionary computation for automatic Web service composition: an indirect representation approach
Web services have become increasingly popular in recent years, and they are especially suitable to the process of Web service… 
2014
2014
INTEGRATED INVENTORY ROUTING PROBLEM WITH QUALITY TIME WINDOW
We investigate an integrated inventory routing problem (IRP) in which one supplier with limited production capacity distributes a… 
2012
2012
Basins of Attraction in the Copenhagen Problem Where the Primaries Are Magnetic Dipoles
We deal with the Copenhagen problem where the two big bodies of equal masses are also magnetic dipoles and we study some aspects… 
2008
2008
AN ENTROPIC ORDER QUANTITY MODEL WITH FUZZY HOLDING COST AND FUZZY DISPOSAL COST FOR PERISHABLE ITEMS UNDER TWO COMPONENT DEMAND AND DISCOUNTED SELLING PRICE
A new type of replenishment policy is suggested in an entropy order quantity model for a perishable product possessing fuzzy… 
2004
2004
Contested Nature of Place: Knowledge Mapping for Resolving Ontological Distinctions Between Geographical Concepts
In the theoretical literature and geographical models, place is defined with reference to other spatial concepts, such as region… 
Highly Cited
2002
Highly Cited
2002
VESPER 1.5 - spatial prediction software for precision agriculture.
VESPER 1.5 is a shareware software program, written to provide rigourous spatial prediction techniques for the precision… 
1993
1993
Boundary interactions for two-dimensional granular flows. Part 2. Roughened boundaries
The global behaviour of a granular flow is critically dependent on its interaction with whatever solid boundaries with which it… 
1990
1990
An upper bound for the total chromatic number
  • H. Hind
  • Graphs Comb.
  • 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
Genetic neighbourhood sizes in Primula vulgaris
Neighbourhoods in natural populations of Primula vulgaris were found to be small, with neighbourhood sizes ranging from 1 to 38… 
1972
1972
Kinship, neighbourhood and social change in Irish rural communities
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)