Concept information
Terme préférentiel
bipartite graph
Définition
-
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V, that is, every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Bipartite_graph)
Concept générique
Concepts spécifiques
Synonyme(s)
- bigraph
Traductions
-
français
URI
http://data.loterre.fr/ark:/67375/PSR-ST2K7066-3
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}