Graph which partitions into a clique and independent set
This article is about graphs that can be partitioned into a clique and an independent set. For cuts that form complete bipartite graphs, see split (graph theory).
A split graph, partitioned into a clique and an independent set.
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: полярные графы).[1]
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).[2]
^Földes & Hammer (1977a) had a more general definition, in which the graphs they called split graphs also included bipartite graphs (that is, graphs that be partitioned into two independent sets) and the complements of bipartite graphs (that is, graphs that can be partitioned into two cliques). Földes & Hammer (1977b) use the definition given here, which has been followed in the subsequent literature; for instance, it is Brandstädt, Le & Spinrad (1999), Definition 3.2.3, p.41.
^Földes & Hammer (1977a); Golumbic (1980), Theorem 6.3, p. 151.
graph theory, a branch of mathematics, a splitgraph is a graph in which the vertices can be partitioned into a clique and an independent set. Split graphs...
In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every...
Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets...
In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not...
In the mathematical field of graph theory, the complement or inverse of a graph G is a graph H on the same vertices such that two distinct vertices of...
comparability graph, it follows that graph and its complement are both interval graphs if and only if the graph is both a splitgraph and a permutation graph. The...
and a splitgraph. Every graph that is both a trivially perfect graph and the complementary graph of a trivially perfect graph is a threshold graph. Threshold...
self-complementary graph, a block graph, a splitgraph, an interval graph, a claw-free graph, a 1-vertex-connected graph and a 1-edge-connected graph. A graph is bull-free...
In graph theory, the strong perfect graph theorem is a forbidden graph characterization of the perfect graphs as being exactly the graphs that have neither...
In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphs that do not belong to...
In graph theory, a branch of mathematics, the splittance of an undirected graph measures its distance from a splitgraph. A splitgraph is a graph whose...
integer k > 1, G cannot be split into k different connected components by the removal of fewer than tk vertices. For instance, a graph is 1-tough if the number...
In graph theory, a dominating set for a graph G is a subset D of its vertices, such that any vertex of G is in D, or has a neighbor in D. The domination...
GQL (Graph Query Language) is a standard graph query language published by ISO in April 2024. The GQL project is the culmination of converging initiatives...
cocolorings of G. The graphs with cochromatic number 2 are exactly the bipartite graphs, complements of bipartite graphs, and splitgraphs. As the requirement...
In the mathematical field of graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of...
register allocation), or across function boundaries traversed via call-graph (interprocedural register allocation). When done per function/procedure...
Global Information