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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Lexicographic depth first search (LexDFS) is a graph search protocol which has already proved to be a powerful tool on… (More)
Is this relevant?
2014
2014
We study square-complementary graphs, that is, graphs whose complement and square are isomorphic. We prove several necessary… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Communication data rate and energy constraints are important factors which have to be considered when investigating distributed… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
2010
The minimum rank of a graph has been an interesting and well studied parameter 6 investigated by many researchers over the past… (More)
  • figure 2.1
  • figure 2.2
Is this relevant?
2007
2007
We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been… (More)
  • figure 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper is about estimating the parameters of the exponential random graph model, also known as the p∗ model, using… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
1996
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1995
1995
We present a distributed garbage collection algorithm that eventually collects all cycles in an open network. As with recent… (More)
  • figure 2
Is this relevant?
1979
1979
A/Mmcr-It is proved that the Shannon zero-error capacity of the pentagon is e. The method is then generalized to obtain upper… (More)
Is this relevant?
Highly Cited
1966
Highly Cited
1966
In this paper G(n ; I) will denote a graph of n vertices and l edges, K„ will denote the complete graph of p vertices G (p ; (PA… (More)
Is this relevant?