| Information | |
|---|---|
| has gloss | eng: 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 , and independently introduced by . |
| lexicalization | eng: split graph |
| instance of | c/Graph families |
| Meaning | |
|---|---|
| Esperanto | |
| has gloss | epo: En grafeteorio, fenda grafeo estas grafeo en kiu la verticoj povas esti disdividitaj en klikon kaj sendependan aron. |
| lexicalization | epo: fenda grafeo |
| Media | |
|---|---|
| media:img | Split graph.svg |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint