Concept information
Término preferido
complete graph
Definición
-
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction).
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Complete_graph)
Concepto genérico
En otras lenguas
-
francés
URI
http://data.loterre.fr/ark:/67375/PSR-R4TC9P7G-2
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}