Metraipolis › archive › dc_72423d9dcd44
Split graph — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Split_graph
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T17:46:20.135Z
- SHA-256 of the archived text
9cab562a1885945ad3cc6ce5f6491848ea077a8a5f6d28c13f03ac7bf97471db- Stable URL of this page
https://metraipolis.com/documento/dc_72423d9dcd44
How to cite
Split graph — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Split_graph (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_72423d9dcd44 (Metraipolis archive dc_72423d9dcd44, sha256 9cab562a1885945ad3cc6ce5f6491848ea077a8a5f6d28c13f03ac7bf97471db)
BibTeX
@misc{dc72423d9dcd44,
title = {Split graph — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Split_graph},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_72423d9dcd44; sha256 9cab562a1885945ad3cc6ce5f6491848ea077a8a5f6d28c13f03ac7bf97471db},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Split_graph. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 (1977a, 1977b), and independently introduced by Tyshkevich and Chernyak (1979), where they called these graphs "polar graphs" (Russian: полярные графы). A split graph may have more than one partition into a clique and an independent set; for instance, the path a–b–c is a split graph, the vertices of which can be partitioned in three different ways: the clique {a, b} and the independent set {c} the clique {b, c} and the independent set {a} the clique {b} and the independent set {a, c} Split graphs can be characterized in terms of their forbidden induced subgraphs: a graph is split if and only if no induced subgraph is a cycle on four or five vertices, or a pair of disjoint edges (the complement of a 4-cycle).
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Split graph» — https://en.wikipedia.org/wiki/Split_graph
Wikidata Q3893853 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3893853
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Split_graph?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1374174535, consultata il 2026-10-15T16:59:05.971Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 0b5470648697c8c3550f773ecdf6411388f8fb01d79309d39ebc091499307b6f