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 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. For example, in the image to the right, the neighbourhood of vertex 5 consists of vertices 1, 2 and 4 and the edge connecting vertices 1 and 2.
Wikipage disambiguates
Adjacency matrixAdjacent vertexAdjacent verticesAlgebraic combinatoricsBipartite double coverBron–Kerbosch algorithmBrooks' theoremChordal graphClaw-free graphClique (graph theory)Clique complexClique problemCluster graphCluster stateClustering coefficientCollinearityConditional random fieldCop-win graphCop numberCovering graphCycle spaceDedekind–MacNeille completionDiamond graphDijkstra's algorithmDistance-hereditary graphGlossary of graph theoryGossip protocolGraph homomorphismGraph theoryGreedy coloringHall's marriage theoremImplicit graphInduced matchingInduced subgraphIntersection number (graph theory)Kempe chainKieka MynhardtKing's graphLangton's loopsList coloring
Link from a Wikipage to another Wikipage
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 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. For example, in the image to the right, the neighbourhood of vertex 5 consists of vertices 1, 2 and 4 and the edge connecting vertices 1 and 2.
has abstract
Em teoria dos grafos, um vérti ...... ence à sua própria vizinhança.
@pt
En teoria de grafs, el veïnat ...... x pertany al seu propi veïnat.
@ca
En teoría de grafos, un vértic ...... a vecindad se presume abierta.
@es
En théorie des graphes on dit ...... prédécesseur ou de successeur.
@fr
In der Graphentheorie versteht ...... en eines Graphen darzustellen.
@de
In graph theory, an adjacent v ...... ongs to its own neighbourhood.
@en
В теории графов смежной вершин ...... лежит собственной окрестности.
@ru
В теорії графів суміжною верши ...... ршина належить власному околу.
@uk
في نظرية الرسومات، يقال عن رأس ...... س ينتمي لمجموعة التجاور لنفسه.
@ar
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
997,784,844
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
Em teoria dos grafos, um vérti ...... conectando os vértices 1 e 2.
@pt
En teoria de grafs, el veïnat ...... ue connecta els vèrtexs 1 i 2.
@ca
En teoría de grafos, un vértic ...... conectando los vértices 1 y 2.
@es
En théorie des graphes on dit ...... prédécesseur ou de successeur.
@fr
In der Graphentheorie versteht ...... en eines Graphen darzustellen.
@de
In graph theory, an adjacent v ...... e connecting vertices 1 and 2.
@en
В теории графов смежной вершин ...... ом, соединяющим вершины 1 и 2.
@ru
В теорії графів суміжною верши ...... ром, що з'єднує вершини 1 і 2.
@uk
في نظرية الرسومات، يقال عن رأس ...... و والضلع الذي يربط الرأسين و .
@ar
label
Nachbarschaft (Graphentheorie)
@de
Neighbourhood (graph theory)
@en
Vecindad (teoría de grafos)
@es
Veïnat (teoria de grafs)
@ca
Vizinhança (teoria dos grafos)
@pt
Voisinage (théorie des graphes)
@fr
Окрестность (теория графов)
@ru
Окіл (теорія графів)
@uk
الجوار (نظرية الرسومات)
@ar