Vertex (graph theory)
In mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another.
Wikipage disambiguates
148 (number)2-satisfiability202 (number)A* search algorithmAction (UML)Aczel's anti-foundation axiomAdjacency listAdjacency matrixApache OozieApproximate max-flow min-cut theoremArborescence (graph theory)Archimedean graphArtificial neural networkAugmented sixth chordAutomatic layoutB*BF-graphBabelfyBarnes–Hut simulationBellman–Ford algorithmBerge's lemmaBetweenness centralityBiconnected componentBiconnected graphBidirectional searchBigraphBiological networkBipartite graphBiregular graphBlossom algorithmBoolean networkBound graphBouquet graphBoxicityBregman–Minc inequalityBucket queueBurr–Erdős conjectureCage (graph theory)Calculus on finite weighted graphsCalkin–Wilf tree
Link from a Wikipage to another Wikipage
primaryTopic
Vertex (graph theory)
In mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another.
has abstract
Als Knoten oder Ecke bezeichne ...... n durch Kanten verbunden sind.
@de
Em teoria dos grafos, um vérti ...... ntal de pode ser descrita como
@pt
En matemàtiques, i més especia ...... ots els vèrtexs adjacents a v.
@ca
En teoría de grafos, un vértic ...... s los vértices adyacentes a v.
@es
En théorie des graphes, un som ...... nts s'ils ne sont pas voisins.
@fr
In mathematics, and more speci ...... by all vertices adjacent to v.
@en
Matematikan, grafo teorian, er ...... z badute, grafo ez-orientatua.
@eu
Nella teoria dei grafi, un ver ...... pigoli aventi origine in esso.
@it
Noder eller hörn är i grafteor ...... till genom att lägga till den.
@sv
Vrchol je v teorii grafů jední ...... ). Z vrcholu mohou vést hrany.
@cs
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
992,383,371
Link from a Wikipage to another Wikipage
title
Graph Vertex
@en
urlname
GraphVertex
@en
wikiPageUsesTemplate
subject
hypernym
type
comment
Als Knoten oder Ecke bezeichne ...... n durch Kanten verbunden sind.
@de
Em teoria dos grafos, um vérti ...... nceitos ou classes de objetos.
@pt
En matemàtiques, i més especia ...... én des d'un vèrtex a un altre.
@ca
En teoría de grafos, un vértic ...... conceptos o clases de objetos.
@es
En théorie des graphes, un som ...... nts s'ils ne sont pas voisins.
@fr
In mathematics, and more speci ...... ng from one vertex to another.
@en
Matematikan, grafo teorian, er ...... z badute, grafo ez-orientatua.
@eu
Nella teoria dei grafi, un ver ...... concetti o classi di oggetti.
@it
Noder eller hörn är i grafteor ...... "intern nod" eller "inre nod".
@sv
Vrchol je v teorii grafů jední ...... ). Z vrcholu mohou vést hrany.
@cs
label
Erpin (grafo teoria)
@eu
Knoten (Graphentheorie)
@de
Nod (grafteori)
@sv
Sommet (théorie des graphes)
@fr
Vertex (graph theory)
@en
Vertice (teoria dei grafi)
@it
Vertico (grafeteorio)
@eo
Vrchol (graf)
@cs
Vèrtex (teoria de grafs)
@ca
Vértice (teoria dos grafos)
@pt