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

self-complementary graph is a graph that is isomorphic to its own complement. Examples include the four-vertex path graph and five-vertex cycle graph...

complement Complement graph Self-complementary graph, a graph which is isomorphic to its complement Complemented lattice Complementary angles Knot complement...

graph is self-complementary, and is also a circulant graph. More generally every Paley graph of prime order is a self-complementary circulant graph....

physics Antisymmetric relation in mathematics Skew-symmetric graph Self-complementary graph In mathematics, especially linear algebra, and in theoretical...

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

x ± 3 (mod 13), and x ± 4 (mod 13). The Paley graphs are self-complementary: the complement of any Paley graph is isomorphic to it. One isomorphism is via...

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

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

C(H). In particular, the lexicographic product of two self-complementary graphs is self-complementary. The independence number of a lexicographic product...

chains in immunoglobulins Complementary angles, in geometry Self-complementary graph, in graph theory Yin and yang, complementary relation between apparent...

Berge's forbidden graph characterization is self-complementary, the weak perfect graph theorem follows immediately from the strong perfect graph theorem. The...

Rado graph. Therefore, the Rado graph is a self-complementary graph. In one of Ackermann's original 1937 constructions, the vertices of the Rado graph are...

graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject...

This also explains why threshold graphs are closed under taking complements; the P4 is self-complementary, hence if a graph is P4-, C4- and 2K2-free, its...

The survival function is the complementary cumulative distribution function of the lifetime. Sometimes complementary cumulative distribution functions...

7-cube girth 4. It seems that the Dejter graph is the smallest symmetric graph having a connected self-complementary vertex-spanning semi-symmetric cubic...

smallest Paley graph, with q = 5, is the 5-cycle (above). Self-complementary arc-transitive graphs are strongly regular. A strongly regular graph is called...

random graphs, and some instances of evolutionary computation and artificial life exhibit features of self-organization. In swarm robotics, self-organization...

symmetric self-complementary if it is cyclically symmetric and self-complementary. The figure presents a cyclically symmetric self-complementary plane partition...

The Ljubljana graph was first published in 1993 by Brouwer, Dejter and Thomassen as a self-complementary subgraph of the Dejter graph. In 1972, Bouwer...

edges between S and the complementary subset is as large as possible. Equivalently, one wants a bipartite subgraph of the graph with as many edges as possible...

their bases, is self-complementary, so the dual of a matroid is necessarily a matroid. The flats of M {\displaystyle M} are complementary to the cyclic...

Chvatal, V.; Erdös, P.; Hedrlín, Z. (1972). "Ramsey's theorem and self-complementary graphs". Discrete Mathematics. 3 (4): 301–304. doi:10.1016/0012-365X(72)90087-8...

on a graph. Will our person reach his home? It turns out that under rather mild conditions, the answer is still yes, but depending on the graph, the answer...

Geometry, 15 (4): 393–408. Coxeter, H.S.M. (1999), "Self-dual configurations and regular graphs", The Beauty of Geometry, Dover, ISBN 0-486-40919-8 Dembowski...

In graph theory, a branch of mathematics, a skew-symmetric graph is a directed graph that is isomorphic to its own transpose graph, the graph formed by...

polyhedron, one can form a planar graph, the graph of its vertices and edges. The dual polyhedron has a dual graph, a graph with one vertex for each face...

different kinds of network graphs, such as undirected rings, unidirectional rings, complete graphs, grids, directed Euler graphs, and others. A general method...

intersect, and when they cross an edge of the polyhedron they make complementary angles on the two incident faces to the edge. Intuitively, one could...