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.

2016

2013

The notion of interval-valued intuitionistic fuzzy sets was first introduced by Atanassov and Gargov as a generalization of both…

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…

1996

We consider instances of the Set Cover problem where each set is of small size. For collections of sets of size at most three, we…

1995

We present a distributed garbage collection algorithm that eventually collects all cycles in an open network. As with recent…

1990

The foundation of a geometric theory for robust stabilization of infinite-dimensional time-varying linear systems is presented…

1989

The mean distance, μ(G), of a graph G is the arithmetic mean of the distances in G. Upper and lower bounds for the mean distance…

1983

This paper studies set assignments on graphs, functions assigning a set S(x) to each vertex x of a graph, and specifically set…

1980