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…

2016

In this paper we investigate invertibility of graphs with a unique perfect matching, i.e. graphs having a unique 1-factor. We…

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…

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

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…

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…