International Journal of Combinatorics / 2012 / Article / Fig 2

Research Article

A Convex Relaxation Bound for Subgraph Isomorphism

Figure 2

An example graph and its adjacency matrix along with its complementary counterpart . The matrices are represented as an appropriate binary image (0 black, 1 white).

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.