Global Information Lookup Global Information

Split graph information


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 abc 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).[2]

  1. ^ 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.
  2. ^ Földes & Hammer (1977a); Golumbic (1980), Theorem 6.3, p. 151.

and 21 Related for: Split graph information

Request time (Page generated in 0.8635 seconds.)

Split graph

Last Update:

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...

Word Count : 1642

Perfect graph

Last Update:

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...

Word Count : 7042

Split

Last Update:

destroyer Split, decommissioned in 1980 Yugoslav frigate Split, Koni-class Split (graph theory) Split (mathematics), a property of an exact sequence Split (phylogenetics)...

Word Count : 483

Glossary of graph theory

Last Update:

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...

Word Count : 15667

Bipartite graph

Last Update:

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...

Word Count : 4087

List of graph theory topics

Last Update:

Split graph String graph Strongly regular graph Threshold graph Total graph Tree (graph theory). Trellis (graph) Turán graph Ultrahomogeneous graph Vertex-transitive...

Word Count : 664

Bull graph

Last Update:

self-complementary graph, a block graph, a split graph, an interval graph, a claw-free graph, a 1-vertex-connected graph and a 1-edge-connected graph. A graph is bull-free...

Word Count : 392

Forbidden graph characterization

Last Update:

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...

Word Count : 1207

Complement graph

Last Update:

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...

Word Count : 1125

Chordal graph

Last Update:

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...

Word Count : 2164

Strong perfect graph theorem

Last Update:

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...

Word Count : 1769

Interval graph

Last Update:

comparability graph, it follows that graph and its complement are both interval graphs if and only if the graph is both a split graph and a permutation graph. The...

Word Count : 2633

Threshold graph

Last Update:

and a split graph. Every graph that is both a trivially perfect graph and the complementary graph of a trivially perfect graph is a threshold graph. Threshold...

Word Count : 817

Cocoloring

Last Update:

cocolorings of G. The graphs with cochromatic number 2 are exactly the bipartite graphs, complements of bipartite graphs, and split graphs. As the requirement...

Word Count : 354

Splittance

Last Update:

In graph theory, a branch of mathematics, the splittance of an undirected graph measures its distance from a split graph. A split graph is a graph whose...

Word Count : 343

Graph toughness

Last Update:

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...

Word Count : 623

Graph embedding

Last Update:

In topological graph theory, an embedding (also spelled imbedding) of a graph G {\displaystyle G} on a surface Σ {\displaystyle \Sigma } is a representation...

Word Count : 1744

Graph isomorphism problem

Last Update:

bipartite Eulerian graphs bipartite regular graphs line graphs split graphs chordal graphs regular self-complementary graphs polytopal graphs of general, simple...

Word Count : 4069

Symmetric graph

Last Update:

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...

Word Count : 1158

Register allocation

Last Update:

register allocation), or across function boundaries traversed via call-graph (interprocedural register allocation). When done per function/procedure...

Word Count : 5066

Graph Query Language

Last Update:

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...

Word Count : 4274

PDF Search Engine © AllGlobal.net