Concept information
Terme préférentiel
biregular graph
Définition
-
In graph-theoretic mathematics, a biregular graph or semiregular bipartite graph is a bipartite graph G = (U, V, E) for which every two vertices on the same side of the given bipartition have the same degree as each other. If the degree of the vertices in U is x and the degree of the vertices in V is y, then the graph is said to be (x, y)-biregular.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Biregular_graph)
Concept générique
Synonyme(s)
- semiregular bipartite graph
Traductions
-
français
URI
http://data.loterre.fr/ark:/67375/PSR-CRCPSSRT-M
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}