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.

2004

Presents an algorithm for finding minimum spanning trees.Compared with the traditional algorithm of Prim and Kruskal,the new…

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…

2002

where X = (X1 1 , ..., X1 n1 , X 2 1 , ..., X 2 n2) is a vector of observable variables with a vector of means mX and covariance…

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…