Neighbourhood (graph theory)
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 induced subgraph of G consisting of all vertices adjacent to v. For example, the image shows a graph of 6 vertices and 7 edges. Vertex 5 is adjacent to vertices 1, 2, and 4 but it is not adjacent to 3 and 6. The neighbourhood of vertex 5 is the graph with three vertices, 1, 2, and 4, and one edge connecting vertices 1 and 2.
Wikipage disambiguates
Wikipage redirect
primaryTopic
Neighbourhood (graph theory)
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 induced subgraph of G consisting of all vertices adjacent to v. For example, the image shows a graph of 6 vertices and 7 edges. Vertex 5 is adjacent to vertices 1, 2, and 4 but it is not adjacent to 3 and 6. The neighbourhood of vertex 5 is the graph with three vertices, 1, 2, and 4, and one edge connecting vertices 1 and 2.
has abstract
Em teoria dos grafos, um vérti ...... ence à sua própria vizinhança.
@pt
En teoría de grafos, un vértic ...... a vecindad se presume abierta.
@es
En théorie des graphes on dit ...... exemple le sous-graphe induit.
@fr
In graph theory, an adjacent v ...... ongs to its own neighbourhood.
@en
Nachbarschaft ist ein grundleg ...... ene Kanten beschreiben lassen.
@de
В теории графов смежной вершин ...... лежит собственной окрестности.
@ru
thumbnail
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
735,053,680
subject
hypernym
comment
Em teoria dos grafos, um vérti ...... conectando os vértices 1 e 2.
@pt
En teoría de grafos, un vértic ...... conectando los vértices 1 y 2.
@es
En théorie des graphes on dit ...... exemple le sous-graphe induit.
@fr
In graph theory, an adjacent v ...... e connecting vertices 1 and 2.
@en
Nachbarschaft ist ein grundleg ...... ene Kanten beschreiben lassen.
@de
В теории графов смежной вершин ...... ом, соединяющим вершины 1 и 2.
@ru
label
Nachbarschaft (Graphentheorie)
@de
Neighbourhood (graph theory)
@en
Vecindad (teoría de grafos)
@es
Vizinhança (teoria dos grafos)
@pt
Voisinage (théorie des graphes)
@fr
Окрестность (теория графов)
@ru
