cograph

cograph
A graph formed from another by complementation and disjoin union

Wikipedia foundation.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Cograph — The Turán graph T(13,4), an example of a cograph In graph theory, a cograph, or complement reducible graph, or P4 free graph, is a graph that can be generated from the single vertex graph K1 by complementation and disjoint union. That is, the… …   Wikipedia

  • Quasi-threshold graph — In graph theoretic mathematics, a quasi threshold graph is a graph that can be constructed using the following rules: # K 1 is a quasi threshold graph #If G is a quasi threshold graph, then so is the graph obtained by adding a new vertex… …   Wikipedia

  • Co-Graph — In der Informatik ist ein Co Graph ein ungerichteter Graph    , welcher sich mit bestimmten elementaren Operationen konstruieren lässt. Auf Co Graphen lassen sich viele schwere Probleme wie z. B. UNABHÄNGIGE MENGE, CLIQUE und… …   Deutsch Wikipedia

  • Complement graph — The Petersen graph (on the left) and its complement graph (on the right). In graph theory, the complement or inverse of a graph G is a graph H on the same vertices such that two vertices of H are adjacent if and only if they are not adjacent in G …   Wikipedia

  • Threshold graph — In graph theory, a threshold graph is a graph that can be constructed from a one vertex graph by repeated applications of the following two operations: #Addition of a single isolated vertex to the graph #Addition of a single dominating vertex to… …   Wikipedia

  • Turán graph — The Turán graph T(13,4) Named after Pál Turán v · …   Wikipedia

  • Clique (graph theory) — A graph with 23 1 vertex cliques (its vertices), 42 2 vertex cliques (its edges), 19 3 vertex cliques (the light blue triangles), and 2 4 vertex cliques (dark blue). Six of the edges and 11 of the triangles form maximal cliques. The two dark blue …   Wikipedia

  • List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

  • Modular decomposition — In graph theory, the modular decomposition is a decomposition of an undirected graph into subsets of vertices called modules. A module is a generalization of a connected component of a graph. Unlike connected components, however, one module can… …   Wikipedia

  • Split graph — In graph theory, 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 in two papers in 1977, and independently introduced by Tyshkevich and… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”