Concept information
Término preferido
split graph
Definición
-
In graph theory, a branch of mathematics, a split graph is a graph in which the vertices can be partitioned into a clique and an independent set. Split graphs were first studied by Földes and Hammer (1977), and independently introduced by Tyshkevich and Chernyak (1979), where they called these graphs "polar graphs" (Russian: полярные графы).
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Split_graph)
Concepto genérico
En otras lenguas
-
francés
-
graphe séparé
URI
http://data.loterre.fr/ark:/67375/PSR-WZW220PJ-9
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}