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.

2017

If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be…

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…

2009

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

2007

In thispaper, we have studied the between independent number of a simple graph and its complementary graph getting the result of.

2003

By making the isomorphism mapping of \%G\% to \%\%, some properties of selfcomplementary graph and mapping are given.

2002

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

2001

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

1999

The factorization of self complementary graph is discussed. It is proved that order 4N is sufficient and necessary for 1 factor…

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…