Concept information
Término preferido
connected graph
Definición
-
In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v. Otherwise, they are called disconnected. If the two vertices are additionally connected by a path of length 1 (that is, they are the endpoints of a single edge), the vertices are called adjacent.
A graph is said to be connected if every pair of vertices in the graph is connected. This means that there is a path between every pair of vertices. An undirected graph that is not connected is called disconnected. An undirected graph G is therefore disconnected if there exist two vertices in G such that no path in G has these vertices as endpoints. A graph with just one vertex is connected. An edgeless graph with two or more vertices is disconnected.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Connectivity_(graph_theory)#Connected_vertices_and_graphs)
Concepto genérico
Conceptos específicos
En otras lenguas
-
francés
URI
http://data.loterre.fr/ark:/67375/PSR-GD4N65WW-T
Concordancia exacta
en.wikipedia.org
fr.wikipedia.org
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}