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

associated graphs. The perfect graph theorem states that the complement graph of a perfect graph is also perfect. The strong perfect graph theorem characterizes...

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

In graph theory, the perfect graph theorem of László Lovász (1972a, 1972b) states that an undirected graph is perfect if and only if its complement graph...

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

edge in the graph has at most one endpoint in S {\displaystyle S} . A set is independent if and only if it is a clique in the graph's complement. The size...

mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes...

μ common neighbours. Such a strongly regular graph is denoted by srg(v, k, λ, μ). Its complement graph is also strongly regular: it is an srg(v, v −...

In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a...

complement Two's complement Complement graph Self-complementary graph, a graph which is isomorphic to its complement Complemented lattice Complement of an angle...

graph or its complement graph contains a clique with at least a logarithmic number of vertices. According to a result of Moon & Moser (1965), a graph...

as: edge contraction, line graph, dual graph, complement graph, graph rewriting; binary operations, which create a new graph from two initial ones, such...

disconnects the graph is the complete set of vertices. The complement graph of a complete graph is an empty graph. If the edges of a complete graph are each...

graph if and only if it has no three-vertex induced path; for this reason, the cluster graphs are also called P3-free graphs. They are the complement...

one vertex. Complete k-partite graphs, complete multipartite graphs, and their complement graphs, the cluster graphs, are special cases of cographs,...

knowledge graph have been further organized using terms from the schema.org vocabulary. The Google Knowledge Graph became a successful complement to string-based...

graph from an initial one by a complex change, such as: transpose graph; complement graph; line graph; graph minor; graph rewriting; power of graph;...

In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges...

have been developed for many subclasses of perfect graphs. In the complement graphs of bipartite graphs, Kőnig's theorem allows the maximum clique problem...

graphs: every bipartite graph, the complement of every bipartite graph, the line graph of every bipartite graph, and the complement of the line graph...

mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each...

In graph theory, a wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle. A wheel graph with n vertices can...

that is, for all vertices, the complement graph of the neighbourhood of the vertex does not contain a triangle. A graph that is locally H is claw-free...

bipartite graphs, line graphs of bipartite graphs, complementary graphs of bipartite graphs, complements of line graphs of bipartite graphs, and double...

overall graph is the complement of the disjoint union of the complements of these independent sets. Chao & Novacky (1982) show that the Turán graphs are chromatically...

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

of graph theory, a self-complementary graph is a graph which is isomorphic to its complement. The simplest non-trivial self-complementary graphs are...

graphs are perfect, the complements of line graphs of bipartite graphs are also perfect. A clique in the complement of the line graph of G is just a matching...

is the complement of a graph hole. Chordless cycles may be used to characterize perfect graphs: by the strong perfect graph theorem, a graph is perfect...

In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with...