Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Split Graph
CHF 43.20
Auf Lager
SKU
E3CTRVJ3FGD
1 Verfügbar 
Geliefert zwischen Mi., 26.11.2025 und Do., 27.11.2025
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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). Note that the partition into a clique and an independent set need not be unique; for instance, the path a b c is a split graph, the vertices of which can be partitioned in three different ways: 1. the clique {a,b} and the independent set {c} 2. the clique {b,c} and the independent set {a} 3. 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).
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131227066
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Größe H220mm x B220mm
- EAN 9786131227066
- Format Fachbuch
- Titel Split Graph
- Herausgeber Betascript Publishing
- Anzahl Seiten 88
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
