Complement graph

Known as: Graph complement, Complement (graph theory), Inverse graph

In graph theory, the complement or inverse of a graph G is a graph H on the same vertices such that two distinct vertices of H are adjacent if and…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2020

A large number of studies have shown that susceptibility to some diseases may be related to some SNP (Single Nucleotide…

2016

This paper presents the results of two explorations: one, exhaustive, of the graph sets from 4 to 10 vertices, and other, using…

2014

Measurement-based quantum computation (MBQC) is a platform for universal quantum computation that only requires the ability to do…

2013

A vertex-colored graph G is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have…

2011

Social network is a graph G = [V;E], in which each vertex from V corresponds to a person and each edge from E describes, that two…

2009

. We consider the feasibility problem OPP in higher-dimensional orthogonal packing: given a set of d -dimensional ( d ≥ 2…

2002

In the first chapter of my lecture I will discuss applications of probabilistic methods to RAMSAY’S theorem, next I will speak an…

2002

If G1 and G2 are two simple graphs, following C. Domb [l], let us denote*with (G,, G2) the number of subgraphs of G2 isomorphic…

2001

every two vertices are connected by an edge. A complete graph Gi3) of three vertices is called a triangle. The complementary…

1989

Let G(V, E) be a simple graph, A_T(?)VUE. A_T is called a total covering of G, if (?)x∈VUE, it holds that x∈A_T or xy∈A_T(y∈V\A_T…