Neighbourhood (graph theory)
id:
neighbourhood-graph-theory-292-14159328
title:
Neighbourhood (graph theory)
text:
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 graph G is the subgraph of G induced by all vertices adjacent to v, i.e., the graph composed of the vertices adjacent to v and all edges connecting vertices adjacent to v. The neighbourhood is often denoted N G or N . The same neighbourhood notation may also be used to refer to sets of adjacent vertices rather than the corresponding induced subgraphs. T
brand slug:
wiki
category slug:
encyclopedia
description:
Subgraph made of all nodes linked to a given node of a graph
original url:
https://en.wikipedia.org/wiki/Neighbourhood_(graph_theory)
date created:
date modified:
2023-08-18T08:52:28Z
main entity:
{"identifier":"Q1354987","url":"https://www.wikidata.org/entity/Q1354987"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/5/5b/6n-graf.svg","width":333,"height":220}
fields total:
13
integrity:
15