Concept information
Terme préférentiel
subgraph
Définition
-
A subgraph of a graph G is another graph formed from a subset of the vertices and edges of G. The vertex subset must include all endpoints of the edge subset, but may also include additional vertices. A spanning subgraph is one that includes all vertices of the graph; an induced subgraph is one that includes all the edges whose endpoints belong to the vertex subset.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Glossary_of_graph_theory#subgraph)
Concept générique
Traductions
-
français
URI
http://data.loterre.fr/ark:/67375/PSR-GZ5F8364-1
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}