Automatically Testing Containedness between Geometric Graph Classes defined by Inclusion, Exclusion, and Transfer Axioms under Simple Transformations

Abstract

We study classes of geometric graphs, which all correspond to the following structural characteristic. For each instance of a vertex set drawn from a universe of possible vertices, each pair of vertices is either required to be connected, forbidden to be connected, or existence or non-existence of an edge is undetermined. The conditions which require or forbid edges are universally quantified predicates defined over the vertex pair, and optionally over existence or non-existence of another edge originating at the vertex pair. We consider further a set of simple graph transformations, where the existence of an edge between two vertices is logically determined by the existence or non-existence of directed edges between both vertices in the original graph. We derive and prove the correctness of a logical expression, which is a necessary and sufficient condition for containedness relations between graph classes that are described this way. We apply the expression on classes of geometric graphs, which are used as theoretical wireless network graph models. The models are constructed from three base class types and intersection combinations of them, with some considered directly and some considered as symmetrized variants using two of the simple graph transformations. Our study then goes systematically over all possible graph classes resulting from those base classes and all possible simple graph transformations. We derive automatically containedness relations between those graph classes. Moreover, in those cases where containedness does not hold, we provide automatically derived counter examples.

1. Introduction

In this paper, we study, for a specific type of axiomatically described graph, how to prove containedness between geometric graph classes automatically. The term graph class here means a collection of graphs that satisfy the same property. Specifically, a geometric graph class refers to graphs with vertices drawn in the Euclidean space, or more generally, in a metric space. Given two graph classes, proving containedness refers to checking whether one class is contained in the other, i.e., any graph from one class is also a valid graph in the other class.

The studied method to prove containedness is illustrated with simple geometric graph models used in the theoretical wireless network research. The method in general is applicable to any geometric graph class, which can be described using a class of axioms containing inclusion conditions, which enforce the existence of an edge between two vertices, exclusion conditions, which prohibit the existence of an edge between two vertices and transfer conditions, which enforce the existence of edges between two vertices depending on the existence of other edges originating from the two vertices to be connected. The axioms depend on properties of the two vertices (inclusion; exclusion) or the three vertices (transfer) but not on the remaining vertices of the vertex set. For any two vertices where neither an edge is enforced or prohibited by the inclusion, exclusion, or transfer conditions, we are free to choose to connect them by an edge or not.

In addition to the graph classes themselves, we also examine graph transformations on graph classes. A transformation is a mapping that constructs a new graph from a given graph on the basis of logical rules applied on edge and vertex properties. More specifically, we consider transformations on graph classes, which we call simple. A simple transformation maps a source graph on an image graph with the same vertex set. The existence or nonexistence of an edge between two vertices in the image graph depends on the existence or nonexistence of the two possible edges between the two vertices in the source graph. Such dependencies can be described using Boolean expressions with two variables.

This work is an extension of our previous work [1], where we studied, with symmetric subgraph and symmetric supergraph, two specific simple transformations. In general, with two edges either existing or not existing, there are 16 simple transformations. In this work, we define those 16 transformations and systematically study all of them by automatically proving containedness relations between all possible classes resulting from specific inclusion, exclusion and transfer axioms and all possible transformations applied on these classes. More precisely, given two graph classes $\mathsf{A}$, $\mathsf{B}$, which can be described using inclusion, exclusion, and transfer axioms, let $\mathsf{C}={\gamma }_1\left(\mathsf{A}\right)$ and $\mathsf{D}={\gamma }_2\left(\mathsf{B}\right)$ be the classes obtained by applying the simple graph transformations, ${\gamma }_1$ and ${\gamma }_2$. We test automatically whether class $\mathsf{C}$ is contained in class $\mathsf{D}$. The test yields satisfiability if the subclass relation $\mathsf{C}\subseteq \mathsf{D}$ holds. Otherwise, if not, the test yields a vertex minimal example graph, which is contained in $\mathsf{C}$ but not in $\mathsf{D}$.

The studied problem is not trivial. On the one hand, the predicates used for enforcing resp. prohibiting edges can be themselves formulas in a complex theory (in which properties or norms, costs or distances need to be specified). On the other hand, consider the question whether a class $\mathsf{C}$ is contained in a class $\mathsf{D}={\gamma }_2\left(\mathsf{B}\right)$ obtained from class $\mathsf{B}$ after applying a (simple) transformation ${\gamma }_2$. To answer this question, one would typically need to demonstrate that for every graph H in class $\mathsf{C}$, there exists a graph G in class $\mathsf{B}$, such that $H={\gamma }_2\left(G\right)$, or to give an example of a graph H in $\mathsf{C}$, such that for every graph G in $\mathsf{B}$, we have $H\ne {\gamma }_2\left(G\right)$. A naive logical encoding of such properties would require quantification over binary relations. In order to avoid these problems, in this paper we demonstrate how expressions (involving only the predicates for enforcing and prohibiting edges and for transfer) for testing containedness between graph classes can be generated in a systematic way. For this, we prove a small model theorem. Our results can be regarded as a form of second-order quantifier elimination [2,3].

In summary, the contributions of this work are: (1) We systematically describe geometric wireless network graph classes on the basis of so-called inclusion, exclusion, and transfer predicates. (2) By means of the so-called simple graph transformations applied on these classes, we cover additional graph classes, with some of them also considered to describe geometric wireless network graphs. (3) We derive a logical formula to automatically verify whether one of such graph clasess described by inclusion, exclusion, and transfer predicates and simple graph transformations is contained in another one or not. (4) The result is used to systematically investigate all possible containedness relations of the so-defined classes, demonstrating all possible combinations in a table at the end of this paper. (5) Finally, for those pairs of classes where containment does not hold, an automatically generated minimal counter example is provided.

The remainder of the paper is structured as follows. In the next section, we illustrate the concept of the considered graph classes and transformations with an example referring to graph models used in theoretical wireless network research. In Section 3, we formally introduce the terminology, in particular, notions such as inclusion, exclusion and transfer axioms and graph classes defined with these types of axioms, as well as the notion of simple transformations. In Section 4, we propose a method of generating finite axiomatizations for a class $\gamma \left(\mathsf{C}\right)$, which do not refer to the edges of graphs in $\mathsf{C}$. Furthermore, we prove a small model theorem (i.e., we demonstrate that searching for a counter example with at most four vertices is sufficient for checking containedness relations for the graph classes and transformations that we study in this paper). We use this for reducing subclass relationship tests to check the satisfiability of expressions (built in a systematic way), which do not refer to the edges of the graphs but only to the inclusion, exclusion and transfer predicates used in the description of the classes. Based on these results, we demonstrate in Section 5 how containedness relations can be proved for the 128 possible graph classes resulting from the examples discussed in Section 2. We conclude this contribution in Section 6 and discuss future research directions on extending the concept of logical graph class definitions and the concept of logical described transformations. The paper is accompanied with three appendices. Appendices Appendix A and Appendix B demonstrate an automatically derived table of the containedness relations between all 128 possible graph classes, as well as the automatically found minimal graph examples for those cases where containedness does not hold. Appendix C finally provides a longer proof for a technical lemma used for the axiomatization of the studied graph transformations.

2. Geometric Graph Models

We illustrate our theory with graph models applied in the theoretical wireless network research. Initial theoretical studies modeled such networks as unit disk graphs $\mathsf{UDG}$, where network vertices are connected if their Euclidean distance is less or equal than 1 and vertices are not connected by self-loops. The model was extended in several directions. We consider the extensions quasi units disk graphs [4,5] and directed transmission graphs [6,7,8] (Note, we consider a maximum communication distance of 1. This is no limitation to other work, where a maximum communication distance $r>0$ is used instead. Obviously, scaling vertex positions with $1/r$ yields the same model with maximum communication distance 1).

Quasi unit disk graphs $\mathsf{QUDG}\left(r\right)$ have a maximum distance 1 and a minimum distance $0<r\le 1$. Two distinct vertices with a Euclidean distance less or equal r are always connected. Two vertices with Euclidean distance greater than 1 are never connected. Any other vertex pairs can be but do not have to be connected. To our knowledge, quasi unit disk graphs have only been studied as undirected graphs. We assume here as well that they are undirected graphs when we speak of quasi unit disk graphs.

With directed transmission graphs $\mathsf{DTG}\left(r\right)$, every vertex v has an individual maximum communication distance $r\left(v\right)\le r$ for some general $r>0$. A directed edge exists from v to w if the distance between v and w is less or equal to $r\left(v\right)$. Directed transmission graphs can be made symmetric by removing all directed edges where the reverse edge is missing, as described in [6,9] or by adding the missing reverse edges, as it is additionally considered in [6]. We denote these graphs by $\mathsf{DTG}{\left(r\right)}^{-}$ and $\mathsf{DTG}{\left(r\right)}^{+}$, respectively.

In the following, we describe the defining properties of the discussed graph models in terms of three base graph classes and the two discussed basic graph transformations, i.e., either removing directed edges where the reverse edge is missing or adding the missing reverse edges.

Definition 1 

(The classes $\mathsf{CRG}$, $\mathsf{MinDG}$, $\mathsf{MaxDG}$). Let $0<r\le 1$. We consider a graph $G=(V,E)$. Let $d(u,v)$ be any metric defined on the vertices (e.g., Euclidean distance when vertices are located in the Euclidean space). Let $E(u,v)$ be $\mathrm{true}$ if $uv\in E$ and $\mathrm{false}$; otherwise, graph G is in the class of min disk graphs $\mathsf{MinDG}\left(r\right)$, max disk graphs $\mathsf{MaxDG}\left(r\right)$, or connected region graphs $\mathsf{CRG}$ if it satisfies the following corresponding conditions:

$$\begin{array}{cc}\hfill \mathsf{MinDG}\left(r\right)& \forall u,v\in V:u\ne v\wedge d(u,v)\le r\Rightarrow E(u,v)\hfill \\ \hfill \mathsf{MaxDG}\left(r\right)& \forall u,v\in V:d(u,v)>r\Rightarrow \neg E(u,v)\hfill \\ \hfill \mathsf{CRG}& \forall u,v,w\in V:E(u,w)\wedge u\ne v\hfill \\ & \wedge d(u,v)\le d(u,w)\Rightarrow E(u,v)\hfill \end{array}$$

Definition 2 

(Symmetric super and subgraph). Given a graph $G=(V,E)$, the graph transformations $G^{+}=(V,E^{+})$ and $G^{-}=(V,E^{-})$, denoted as symmetric supergraph and symmetric subgraph, respectively, are defined by:

$$\begin{array}{cc}\hfill E^{+}& =\{uv:uv\in E\mathrm{or}vu\in E\}\hfill \\ \hfill E^{-}& =\{uv:uv\in E\mathrm{and}vu\in E\}\hfill \end{array}$$

When applied on a whole graph class $\mathsf{C}$, we write ${\mathsf{C}}^{\gamma }$, which means that the transformation γ is applied on each graph contained in $\mathsf{C}$.

Obviously, the graph class of unit disk graphs can be built from the defined base classes, as follows

$$\mathsf{UDG}=\mathsf{MinDG}\left(1\right)\cap \mathsf{MaxDG}\left(1\right)$$

where intersection ∩ means that the graph is contained in both classes, or expressed alternatively, has to satisfy the logical predicates of both classes.

Together with the two basic graph transformations, the class of quasi unit disk graphs [4,5] is given by

$$\begin{array}{cc}\hfill \mathsf{QUDG}\left(r\right)& ={(\mathsf{MinDG}\left(r\right)\cap \mathsf{MaxDG}\left(1\right))}^{-}\hfill \\ & ={(\mathsf{MinDG}\left(r\right)\cap \mathsf{MaxDG}\left(1\right))}^{+}\hfill \end{array}$$

The latter equality holds, since an edge $uv$ is optional if $vu$ is optional, i.e., $r<d(u,v)=d(v,u)\le 1$. Obviously, $\mathsf{QUDG}\left(1\right)$ is the special case of unit disk graphs $\mathsf{UDG}$.

The class of directed transmission graphs [6,7,8] is given by

$$\begin{array}{cc}\hfill \mathsf{DTG}\left(r\right)& =\mathsf{MaxDG}\left(r\right)\cap \mathsf{CRG}\hfill \end{array}$$

This is followed immediately by setting the individual maximum communication distance of vertex v to $r\left(v\right)=max\left\{d\right(v,w):vw\in E\}$. The symmetric variant considered in [9] has no maximum communication distance and is obtained by removing all directed edges where the reverse edge is missing. It is thus described by ${\mathsf{CRG}}^{-}$. The symmetric variants considered in [6] are $\mathsf{DTG}{\left(r\right)}^{-}$ and $\mathsf{DTG}{\left(r\right)}^{+}$ in our graph class notation.

3. Axiomatic Description of Graph Classes

3.1. Inclusion, Exclusion, and Transfer Predicates

Generally speaking, in the motivating example, we consider graph classes $\mathsf{C}$, where each graph $G=(V,E)$ consists of vertices V of a vertex universe $\mathsf{\Omega }$ and an edge relation E, which satisfies

$$\begin{array}{cc}\hfill \forall u,v\in V& :{\pi }_{\mathsf{C}}^i(u,v)\Rightarrow E(u,v)\hfill \end{array}$$

(1)

$$\begin{array}{cc}\hfill \forall u,v\in V& :{\pi }_{\mathsf{C}}^e(u,v)\Rightarrow \neg E(u,v)\hfill \end{array}$$

(2)

$$\begin{array}{cc}\hfill \forall u,v,w\in V& :E(u,w)\wedge {\pi }_{\mathsf{C}}^t(u,v,w)\Rightarrow E(u,v)\hfill \end{array}$$

(3)

$$\begin{array}{cc}\hfill \forall u,v,w\in V& :\neg E(u,w)\wedge {\pi }_{\mathsf{C}}^t(u,w,v)\Rightarrow \neg E(u,v)\hfill \end{array}$$

(4)

We term ${\pi }_{\mathsf{C}}^i(u,v)$, ${\pi }_{\mathsf{C}}^e(u,v)$ and ${\pi }_{\mathsf{C}}^t(u,v,w)$ inclusion, exclusion, and transfer predicates, respectively. We will refer to the Conditions (1)–(3) as inclusion, exclusion and transfer axioms, accordingly (though Conditions (3) and (4) are equivalent, we list both here for later reference).

We say that a graph $G=(V,E)$ is in class $\mathsf{C}$ (and write $G\in \mathsf{C}$) if G satisfies the Conditions (1)–(3). In this case, we sometimes also write Gsatisfies class $\mathsf{C}$. If the graph class C consists of all graphs satisfying a set of axioms of the form (1)–(3), we will say that C is a graph class described by inclusion, exclusion, and transfer axioms. In this work, we will study such graph classes and transformations on them. We make the following additional assumptions:

Assumption A1.

(Independence)We assume that the inclusion, exclusion and transfer predicates are determined by the properties of their arguments $u,v,w\in V$ and are independent of any other vertices in V. We can ensure this, for instance, by requiring that these predicates are expressed as quantifier-free formulae over a background theory.

The inclusion, exclusion, and transfer predicates defining the classes $\mathsf{MinDG}\left(\mathsf{r}\right)$, $\mathsf{MaxDG}\left(\mathsf{r}\right)$ and $\mathsf{CRG}$ in Section 2 can be expressed as quantifier-free formulas over a theory in which we can talk about points and distances between points:

$$\begin{array}{ccc}\hfill {\pi }_{\mathsf{C}}^i(u,v)& :=& u\ne v\wedge d(u,v)\le r\hfill \\ \hfill {\pi }_{\mathsf{C}}^e(u,v)& :=& d(u,v)>r\hfill \\ \hfill {\pi }_{\mathsf{C}}^t(u,v,w)& :=& u\ne v\wedge d(u,v)\le d(u,w)\hfill \end{array}$$

Assumption A2.

(Transitivity)We assume the transfer predicates ${\pi }_{\mathsf{C}}^t(u,v,w)$ to be transitive, i.e.,

$${\pi }_{\mathsf{C}}^t(u,v,w)\wedge {\pi }_{\mathsf{C}}^t(u,w,x)\Rightarrow {\pi }_{\mathsf{C}}^t(u,v,x)$$

Obviously, the transfer predicate defining $\mathsf{CRG}$ in Section 2 is transitive.

Assumption A3.

(Soundness)We assume inclusion, exclusion, and transitive transfer predicates to be sound, which means that they are not contradicting:

$$\begin{array}{cc}\hfill \forall u,v\in V& :{\pi }_{\mathsf{C}}^i(u,v)\Rightarrow \neg {\pi }_{\mathsf{C}}^e(u,v)\hfill \\ \hfill \forall u,v,w\in V& :{\pi }_{\mathsf{C}}^i(u,w)\wedge {\pi }_{\mathsf{C}}^t(u,v,w)\Rightarrow \neg {\pi }_{\mathsf{C}}^e(u,v)\hfill \end{array}$$

We term a graph class to be sound in this case.

It is easy to see, as long as $r_1\le r_2$ any conjunction of the predicates $\mathsf{MinDG}\left(r_1\right)$, $\mathsf{MaxDG}\left(r_2\right)$ and $\mathsf{CRG}$ defined in Section 2 satisfies the soundness condition.

3.2. Simple Graph Class Transformations

The most general form of a graph transformation $\gamma$ is a mapping which transfers a given graph G into a graph H. A graph transformation applied on a graph class $\mathsf{C}$ results in a graph class $\gamma \left(\mathsf{C}\right)$, which consists of all graphs H for which there exists a graph $G\in \mathsf{C}$ with $H=\gamma \left(G\right)$.

We say a graph transformation $\gamma$ is vertex preserving if $\gamma \left(G\right)$ has the same vertex set as G, i.e., given $G=(V,E)$, the transformation is $\gamma \left(G\right)=(V,F)$ for some F. Obviously, a vertex preserving transformation $\gamma$ on the null graph$(\varnothing ,\varnothing )$ yields the null graph.

We term a vertex preserving graph transformation simple if there exists a Boolean function in two variables $\delta :{\mathbb{B}}^2\to \mathbb{B}$ (where $\mathbb{B}$ is the two-element Boolean algebra) such that for all graphs $G=(V,E)$ the transformation $\gamma \left(G\right)=(V,F)$ satisfies

$$\forall u,v\in V:F(u,v)=\delta \left(E\right(u,v),E(v,u\left)\right)$$

The symmetric super graph ${(·)}^{+}$ and symmetric subgraph ${(·)}^{-}$ are obviously simple transformations with boolean functions ∨ and ∧, respectively. As there are $4^2=16$ possible Boolean functions of the form $\delta :{\mathbb{B}}^2\to \mathbb{B}$, in total, there exist 16 possible vertex preserving simple graph transformations, as shown in

Table 1. The eight non-negated vertex preserving simple graph transformations.

		$\mathit{\delta }\left(\mathit{E}\right(\mathit{u},\mathit{v}),\mathit{E}(\mathit{v},\mathit{u}\left)\right)$
		$\mathit{E}(\mathit{u},\mathit{v})$	0	0	1	1
Name	Symbol	$\mathit{E}(\mathit{v},\mathit{u})$	0	1	0	1	Symmetry
Symmetric subgraph	$G^{-}$	$F(u,v)$	0	0	0	1	Symmetric
Symmetric supergraph	$G^{+}$	$F(u,v)$	0	1	1	1	Symmetric
xor graph	$G^{\oplus }$	$F(u,v)$	0	1	1	0	Symmetric
Empty graph	${\mathsf{G}}^{\perp }$	$F(u,v)$	0	0	0	0	Symmetric
Identity graph	$G^{\mathrm{id}}$	$F(u,v)$	0	0	1	1
Reversed graph	$G^{\leftrightarrow }$	$F(u,v)$	0	1	0	1
Outgoing directed subgraph	$G^{\to }$	$F(u,v)$	0	0	1	0	Directed
Incoming directed subgraph	$G^{\leftarrow }$	$F(u,v)$	0	1	0	0	Directed

and

Table 2. The eight negated vertex preserving simple graph transformations.

	$\mathit{\delta }\left(\mathit{E}\right(\mathit{u},\mathit{v}),\mathit{E}(\mathit{v},\mathit{u}\left)\right)$
	$\mathit{E}(\mathit{u},\mathit{v})$	0	0	1	1
Symbol	$\mathit{E}(\mathit{v},\mathit{u})$	0	1	0	1	Symmetry
$G^{\neg -}$	$F(u,v)$	1	1	1	0	Symmetric
$G^{\neg +}$	$F(u,v)$	1	0	0	0	Symmetric
$G^{\neg \oplus }$	$F(u,v)$	1	0	0	1	Symmetric
$G^{\neg \perp }$	$F(u,v)$	1	1	1	1	Symmetric
$G^{\neg \mathrm{id}}$	$F(u,v)$	1	1	0	0
$G^{\neg \leftrightarrow }$	$F(u,v)$	1	0	1	0
$G^{\neg \to }$	$F(u,v)$	1	1	0	1	Complementary directed
$G^{\neg \leftarrow }$	$F(u,v)$	1	0	1	1	Complementary directed

.

In both tables, all four possible combinations of existence or non-existence of the edge $uv$ and $vu$ in the original graph is shown in the table header by the column values 0 and 1 for $E(u,v)$ and $E(v,u)$. For each of those possible cases, the edge $uv$ can be added or not added to the resulting image graph. All possible combinations are shown by the eight rows of both tables (i.e., 16 in total) by the values 0 and 1 for $F(u,v)$, where $F(u,v)$ defines the existence or non-existence of the edge $uv$ in the resulting image graph.

We define for each transformation a symbol and a mnemonic in Table 1. For each transformation in that table, the negated form can be defined, as listed in Table 2. Given a transformation $\gamma$, the negated transformation $\neg \gamma$ yields the complement graph of the graph G resulting from $\gamma$, i.e., each existing edge in G is erased and each missing edge in G is added. Specifically for the transformation empty graph $G^{\perp }$, the negated empty graph $G^{\neg \perp }$ is the complete graph, of course.

We list in the last column of Table 1 whether the transformations always yield a symmetric graph (i.e., $\forall u,v\in V:F(u,v)\Rightarrow F(v,u)$), a directed graph (i.e., $\forall u,v\in V:F(u,v)\Rightarrow \neg F(v,u)$), or whether we keep that column entry empty if the image graph is neither necessarily symmetric nor directed. As shown in Table 2, the symmetry is preserved for the complementary graphs given by the negated transformations. However, the last two shown transformations yield graphs, which we term complementary directed, which means that the complement of the graph is directed.

In the following discussion, we have to distinguish between the two specific transformations xor graph $G^{\oplus }$ and as well negate the xor graph $G^{\neg \oplus }$ and all remaining ones. It turns out that for all cases, despite these two xor ones, a small counter example with, at most, four vertices can be found if a subclass relation does not hold. For the two xor cases, this is not the case. For these two transformations, arbitrary long chains of edge dependencies to determine minimum counter examples are possible. The proof is given in Lemma 5. Only under a specific condition (as discussed later), and also for the two xor cases, proving that a subclass relation does not hold, is possible with a four vertex example.

To distinguish between those situations where all transformation are considered and where all despite the two xor cases are considered, we define for the following discussion by

$$\mathsf{\Gamma }=\{{(·)}^x,{(·)}^{\neg x}:x=-,+,\perp ,\mathrm{id},\leftrightarrow ,\to ,\leftarrow \}$$

the set of all transformations except the two transformations $G^{\oplus }$ and $G^{\neg \oplus }$.

4. Proving Graph Class Containedness Relations

4.1. General Properties

As stated by the following lemmas, it is easy to see that graph classes described by inclusion, exclusion and transfer axioms, which satisfy Independence (Assumption 1), and  graph classes obtained by applying a simple transformation on such graph classes are closed under induced subgraphs (Given a graph $G=(V,E)$, the graph $G^{\prime }$ induced by $V^{\prime }\subseteq V$ consists of vertex set $V^{\prime }$ and all edges from E connecting the vertices in $V^{\prime }$). Moreover, given a sound graph class, for each finite vertex set V, we can find an edge configuration such that the given graph class axioms are satisfied.

Lemma 1.

Let $\mathsf{C}$ be a graph class described by inclusion, exclusion and transfer predicates, satisfying Independence (Assumption 1). It holds:

• The null graph $(\varnothing ,\varnothing )$ satisfies $\mathsf{C}$.
• Let $G=(V,E)$ satisfy $\mathsf{C}$. Every subgraph $G^{\prime }$ induced by $V^{\prime }\subseteq V$ satisfies $\mathsf{C}$.

Proof. 

Obviously $V=\varnothing$ satisfies any universally quantified condition and thus also Conditions (1)–(3).

For the second statement, consider a graph $G=(V,E)$, which satisfies $\mathsf{C}$. Conditions (1)–(3) are satisfied for V. Let $V^{\prime }\subseteq V$. Consider one of the conditions defining the class $\mathsf{C}$, say Condition (1):

$$\forall u,v:{\pi }_{\mathsf{C}}^i(u,v)\Rightarrow E(u,v).$$

Let $u,v\in V^{\prime }$. Then, $u,v\in V$. Assume that ${\pi }_{\mathsf{C}}^i(u,v)$ is true (relative to the set of edges, $V^{\prime }$). By Independence (Assumption 1), the value of this predicate is independent of the other vertices in the graph, so ${\pi }_{\mathsf{C}}^i(u,v)$ is true also when we consider the whole set of vertices in $G=(V,E)$. As G satisfies Condition (1), it follows that $E(u,v)$ is true (i.e., there is an edge from u to v in G). Since $E^{\prime }=E\cap (V^{\prime }\times V^{\prime })$, there is an edge from u to v also in $G^{\prime }$.

The same line of argumentation can be used for Conditions (1) and (2). This shows that also the subgraph $G^{\prime }$ induced by $V^{\prime }$ satisfies $\mathsf{C}$.    □

Remark 1.

The first part of Lemma 1 holds for every graph class, which consists of all graphs satisfying a set of universally quantified axioms.

The second part of Lemma 1 is vacuously true if Soundness (Assumption 3) does not hold, because in this case the graph class contains only the empty graph, which does not have proper subgraphs.

If Independence (Assumption 1) is not satisfied, then the second part of Lemma 1 does not necessarily hold. Consider, for instance, the graph class C described by axioms of the form (1)–(3), where for all $u,v,x$:

$$\begin{array}{cc}\hfill {\pi }_{\mathsf{C}}^i(u,v)& =\forall w\left(\right(w\ne u\wedge w\ne v)\Rightarrow (E(u,w)\wedge E(w,v)\left)\right)\hfill \\ \hfill {\pi }_{\mathsf{C}}^e(u,v)& =\mathrm{false},{\pi }_{\mathsf{C}}^t(u,x,v)=\mathrm{false}.\hfill \end{array}$$

In this graph class, the graph $G=\left(\right\{a,b,c,d,e\},$$\left\{\right(a,b),(b,e),(a,d),(d,e\left)\right\})$ satisfies the Axioms (1)–(3), but the subgraph induced by $V^{\prime }=\{a,b,d,e\}$ does not satisfy axiom (1).

Lemma 2.

Let $\mathsf{C}$ be a graph class defined by inclusion, exclusion and transfer predicates satisfying Independence (Assumption 1) and γ be a vertex preserving graph transformation. It holds:

• The null graph $(\varnothing ,\varnothing )$ satisfies $\gamma \left(\mathsf{C}\right)$.
• If γ is simple and if $H=(V,F)$ satisfies $\gamma \left(\mathsf{C}\right)$, then every subgraph $H^{\prime }$ induced by $V^{\prime }\subseteq V$ satisfies $\gamma \left(\mathsf{C}\right)$.

Proof. 

The first statement follows immediately: $(\varnothing ,\varnothing )=\gamma \left(\right(\varnothing ,\varnothing \left)\right)$ since $\gamma$ is vertex preserving, and  $\gamma \left(\right(\varnothing ,\varnothing \left)\right)\in \gamma \left(\mathsf{C}\right)$ since $(\varnothing ,\varnothing )\in \mathsf{C}$ with Lemma 1.

For the second statement, consider a graph $H=(V,F)$, which satisfies $\gamma \left(\mathsf{C}\right)$. With $\gamma$ being vertex preserving, there exists a graph $G=(V,E)\in \mathsf{C}$ such that $H=\gamma \left(G\right)$. Let $V^{\prime }\subseteq V$, $H^{\prime }=(V^{\prime },F^{\prime })$ be the subgraph of H and $G^{\prime }=(V^{\prime },E^{\prime })$ be the subgraph of G induced by $V^{\prime }$, respectively.

Let $\delta$ be the boolean function of the simple transformation $\gamma$. For all $u,v\in V^{\prime }$ holds: $uv$ is an edge of $\gamma \left(G^{\prime }\right)$ iff

$$\begin{array}{c}\hfill \delta (E^{\prime }(u,v),E^{\prime }(v,u))\iff \delta (E(u,v),E(v,u))\\ \hfill \iff F(u,v)\iff F^{\prime }(u,v)\end{array}$$

(5)

This implies $H^{\prime }=\gamma \left(G^{\prime }\right)$, and thus $H^{\prime }\in \gamma \left(\mathsf{C}\right)$, since $G^{\prime }\in \mathsf{C}$ with Lemma 1.    □

Remark 2.

The second part of Lemma 2 does not necessarily hold if the transformation γ is not simple. Consider, for instance, the transformation defined by

$$\begin{array}{cc}\hfill \forall u,v& \left(\varphi (u,v)\to F(u,v)\right),\hfill \\ \hfill \forall u,v& \left(\neg \varphi (u,v)\to \neg F(u,v)\right)\hfill \end{array}$$

where $\varphi (u,v):=\forall w\left((u\ne w\wedge v\ne w)\to \left(E\right(u,w)\wedge E(w,v\left)\right)\right)$.

Let $\mathsf{C}$ be a graph class defined by inclusion, exclusion and transfer axioms containing the graph $G=\left(\right\{a,b,c,d\},\{(a,b),(b,d)\left\}\right)$ due to the fact that in this specific graph ${\pi }_{\mathsf{C}}^i(a,b)={\pi }_{\mathsf{C}}^i(b,d)=\mathrm{true}$, ${\pi }_{\mathsf{C}}^e(x,y)=\mathrm{true}$ for all other pairs of vertices, and ${\pi }_{\mathsf{C}}^t(u,v,w)$ is false everywhere. Then $H=\gamma \left(G\right)=\left(\right\{a,b,c,d\},\varnothing )\in \gamma \left(\mathsf{C}\right)$. However, the subgraph $H^{\prime }$ of H induced by $V^{\prime }=\{a,b,d\}$ is not in $\gamma \left(\mathsf{C}\right)$: Assume there exists a graph $G^{\prime }\in \mathsf{C}$ with $H^{\prime }=\gamma \left(G^{\prime }\right)$. Since $G^{\prime }\in \mathsf{C}$, due to the fact that ${\pi }_{\mathsf{C}}^i(a,b)={\pi }_{\mathsf{C}}^i(b,d)=\mathrm{true}$, ${\pi }_{\mathsf{C}}^e(x,y)=\mathrm{true}$ for all other pairs of vertices, and ${\pi }_{\mathsf{C}}^t$ is false everywhere, the set of edges of $G^{\prime }$ must be $E=\left\{\right(a,b),(b,d\left)\right\}$. But then in this case $\forall w(a\ne w\wedge d\ne w\to E(a,w)\wedge E(w,d\left)\right)$ holds, so in $\gamma \left(G^{\prime }\right)$, an edge $(a,d)$ should exist. However, this edge is missing in $H^{\prime }$.

Lemma 3.

Let $\mathsf{C}$ be a graph class defined over sound conditions (Assumption 3). For each finite set $V\subseteq \mathsf{\Omega }$ at least one graph $G=(V,E)$ exists, which satisfies $\mathsf{C}$.

Proof. 

Consider any such set V. Set $E(u,v)=\mathrm{true}$ if ${\pi }_{\mathsf{C}}^i(u,v)$ holds or if there exist a $w\in V$ such that ${\pi }_{\mathsf{C}}^i(u,w)\wedge {\pi }_{\mathsf{C}}^t(u,v,w)$ holds. Otherwise set $E(u,v)=\mathrm{false}$. This configuration obviously Satisfies (1) and (3), and does not Contradict (2) since the conditions are sound. Thus, the such defined graph $G=(V,E)$ satisfies $\mathsf{C}$.    □

Note that if $\mathsf{C}$ is a graph class defined using inclusion, exclusion and transfer axioms and $\gamma$ is a simple vertex preserving transformation, it is not immediate that $\gamma \left(\mathsf{C}\right)$ can also be described by inclusion, exclusion and transfer axioms.

In Section 4.2, we show that when $\gamma \in \mathsf{\Gamma }$ we can describe the properties of the edge-relation F of graphs $H=(V,F)$ in $\gamma \left(\mathsf{C}\right)$ using axioms in which only F and the inclusion, exclusion and transfer predicates ${\pi }_{\mathsf{C}}^i(u,v),{\pi }_{\mathsf{C}}^e(u,v)$ and ${\pi }_{\mathsf{C}}^t(u,v,w)$ are used.

4.2. Axiomatization for $\gamma \left(\mathsf{C}\right)$

We next show the connection between edge configurations $F(u,v)$ for a graph being in a class transformed by a transformation in $\mathsf{\Gamma }$ and the inclusion, exclusion and transfer predicates of that class.

Lemma 4.

Let $\mathsf{B}$ be a sound graph class described by inclusion, exclusion and transitive transfer predicates ${\pi }_{\mathsf{B}}^i(u,v)$, ${\pi }_{\mathsf{B}}^e(u,v)$, ${\pi }_{\mathsf{B}}^t(u,v,w)$, respectively. Let γ be any of the vertex preserving, simple graph transformations in Γ. A graph $H=(V,F)$ is in class $\gamma \left(\mathsf{B}\right)$, if for every $u,v\in V$ the edge relation $F(u,v)$ satisfies the implications depicted in

Table 3. The expressions implied by edge existence and non-existence under the considered vertex preserve the simple graph class transformations in $\mathsf{\Gamma }$. Quantification is over all vertices V of the considered graph $H=(V,F)$. The maximum size of a minimum witness graph to find a counter example is expressed by $\mu \left(\gamma \right)$.

$\mathit{\gamma }$	Edge Inclusion and Exclusion Implications			$\mathit{\mu }\left(\mathit{\gamma }\right)$
$H\in {\mathsf{B}}^{\perp }$	$F(u,v)$	⇒	⊥	1
	$\neg F(u,v)$	⇒	⊤
$H\in {\mathsf{B}}^{\neg \perp }$	$F(u,v)$	⇒	⊤	1
	$\neg F(u,v)$	⇒	⊥
$H\in \mathsf{B}$	$F(u,v)$	⇒	$\neg {\pi }_{\mathsf{B}}^e(u,v)$	3
	$\neg F(u,v)$	⇒	$\neg {\pi }_{\mathsf{B}}^i(u,v)\wedge \forall w:$$\neg F(u,w)\vee \neg {\pi }_{\mathsf{B}}^t(u,v,w)$
$H\in {\mathsf{B}}^{\neg }$	$F(u,v)$	⇒	$\neg {\pi }_{\mathsf{B}}^i(u,v)$	3
	$\neg F(u,v)$	⇒	$\neg {\pi }_{\mathsf{B}}^e(u,v)\wedge \forall w:$$\neg F(u,w)\vee \neg {\pi }_{\mathsf{B}}^t(u,w,v)$
$H\in {\mathsf{B}}^{-}$	$F(u,v)$	⇒	$F(v,u)\wedge \neg {\pi }_{\mathsf{B}}^e(u,v)\wedge \forall w:$$\neg {\pi }_{\mathsf{B}}^e(u,w)\vee \neg {\pi }_{\mathsf{B}}^t(u,w,v)$	4
	$\neg F(u,v)$	⇒	$(\neg {\pi }_{\mathsf{B}}^i(u,v)\wedge \forall x:\neg F(u,x)\wedge \neg {\pi }_{\mathsf{B}}^i(u,x)\vee \neg {\pi }_{\mathsf{B}}^t(u,v,x))\vee$
			$(\neg {\pi }_{\mathsf{B}}^i(v,u)\wedge \forall y:\neg F(v,y)\wedge \neg {\pi }_{\mathsf{B}}^i(v,y)\vee \neg {\pi }_{\mathsf{B}}^t(v,u,y))$
$H\in {\mathsf{B}}^{\neg -}$	$F(u,v)$	⇒	$(\neg {\pi }_{\mathsf{B}}^i(u,v)\wedge \forall x:F(u,x)\wedge \neg {\pi }_{\mathsf{B}}^i(u,x)\vee \neg {\pi }_{\mathsf{B}}^t(u,v,x))\vee$	4
			$(\neg {\pi }_{\mathsf{B}}^i(v,u)\wedge \forall y:F(v,y)\wedge \neg {\pi }_{\mathsf{B}}^i(v,y)\vee \neg {\pi }_{\mathsf{B}}^t(v,u,y))$
	$\neg F(u,v)$	⇒	$\neg F(v,u)\wedge \neg {\pi }_{\mathsf{B}}^e(u,v)\wedge \forall w:\neg {\pi }_{\mathsf{B}}^e(u,w)\vee \neg {\pi }_{\mathsf{B}}^t(u,w,v)$
$H\in {\mathsf{B}}^{+}$	$F(u,v)$	⇒	$(\neg {\pi }_{\mathsf{B}}^e(u,v)\wedge \forall x:F(u,x)\wedge \neg {\pi }_{\mathsf{B}}^e(u,x)\vee \neg {\pi }_{\mathsf{B}}^t(u,x,v))\vee$	4
			$(\neg {\pi }_{\mathsf{B}}^e(v,u)\wedge \forall y:F(v,y)\wedge \neg {\pi }_{\mathsf{B}}^e(v,y)\vee \neg {\pi }_{\mathsf{B}}^t(v,y,u))$
	$\neg F(u,v)$	⇒	$\neg F(v,u)\wedge \neg {\pi }_{\mathsf{B}}^i(u,v)\wedge \forall w:\neg {\pi }_{\mathsf{B}}^i(u,w)\vee \neg {\pi }_{\mathsf{B}}^t(u,v,w)$
$H\in {\mathsf{B}}^{\neg +}$	$F(u,v)$	⇒	$F(v,u)\wedge \neg {\pi }_{\mathsf{B}}^i(u,v)\wedge \forall w:\neg {\pi }_{\mathsf{B}}^i(u,w)\vee \neg {\pi }_{\mathsf{B}}^t(u,v,w)$	4
	$\neg F(u,v)$	⇒	$(\neg {\pi }_{\mathsf{B}}^e(u,v)\wedge \forall x:\neg F(u,x)\wedge \neg {\pi }_{\mathsf{B}}^e(u,x)\vee \neg {\pi }_{\mathsf{B}}^t(u,x,v))\vee$
			$(\neg {\pi }_{\mathsf{B}}^e(v,u)\wedge \forall y:\neg F(v,y)\wedge \neg {\pi }_{\mathsf{B}}^e(v,y)\vee \neg {\pi }_{\mathsf{B}}^t(v,y,u))$
$H\in {\mathsf{B}}^{\leftrightarrow }$	$F(u,v)$	⇒	$\neg {\pi }_{\mathsf{B}}^e(v,u)$	3
	$\neg F(u,v)$	⇒	$\neg {\pi }_{\mathsf{B}}^i(v,u)\wedge \forall w:\neg F(w,v)\vee \neg {\pi }_{\mathsf{B}}^t(v,u,w)$
$H\in {\mathsf{B}}^{\neg \leftrightarrow }$	$F(u,v)$	⇒	$\neg {\pi }_{\mathsf{B}}^i(v,u)\wedge \forall w:F(w,v)\vee \neg {\pi }_{\mathsf{B}}^t(v,u,w)$	3
	$\neg F(u,v)$	⇒	$\neg {\pi }_{\mathsf{B}}^e(v,u)$
$H\in {\mathsf{B}}^{\to }$	$F(u,v)$	⇒	$\neg F(v,u)\wedge \neg {\pi }_{\mathsf{B}}^e(u,v)\wedge \forall x:(\neg {\pi }_{\mathsf{B}}^e(u,x)\wedge \neg F(x,u))\vee \neg {\pi }_{\mathsf{B}}^t(u,x,v)\wedge$	4
			$\neg {\pi }_{\mathsf{B}}^i(v,u)\wedge \forall y:(\neg {\pi }_{\mathsf{B}}^i(v,y)\wedge \neg F(v,y))\vee \neg {\pi }_{\mathsf{B}}^t(v,u,y)$
	$\neg F(u,v)$	⇒	$\neg {\pi }_{\mathsf{B}}^i(u,v)\wedge \forall x:(\neg {\pi }_{\mathsf{B}}^i(u,x)\wedge \neg F(u,x))\vee \neg {\pi }_{\mathsf{B}}^t(u,v,x)\vee$
			$\neg {\pi }_{\mathsf{B}}^e(v,u)\wedge \forall y:(\neg {\pi }_{\mathsf{B}}^e(v,y)\wedge \neg F(y,v))\vee \neg {\pi }_{\mathsf{B}}^t(v,y,u)$
$H\in {\mathsf{B}}^{\neg \to }$	$F(u,v)$	⇒	$\neg {\pi }_{\mathsf{B}}^i(u,v)\wedge \forall x:(\neg {\pi }_{\mathsf{B}}^i(u,x)\wedge F(u,x))\vee \neg {\pi }_{\mathsf{B}}^t(u,v,x)\vee$	4
			$\neg {\pi }_{\mathsf{B}}^e(v,u)\wedge \forall y:(\neg {\pi }_{\mathsf{B}}^e(v,y)\wedge F(y,v))\vee \neg {\pi }_{\mathsf{B}}^t(v,y,u)$
	$\neg F(u,v)$	⇒	$F(v,u)\wedge \neg {\pi }_{\mathsf{B}}^e(u,v)\wedge \forall x:(\neg {\pi }_{\mathsf{B}}^e(u,x)\wedge F(x,u))\vee \neg {\pi }_{\mathsf{B}}^t(u,x,v)\wedge$
			$\neg {\pi }_{\mathsf{B}}^i(v,u)\wedge \forall y:(\neg {\pi }_{\mathsf{B}}^i(v,y)\wedge F(v,y))\vee \neg {\pi }_{\mathsf{B}}^t(v,u,y)$
$H\in {\mathsf{B}}^{\leftarrow }$	$F(u,v)$	⇒	$\neg F(v,u)\wedge \neg {\pi }_{\mathsf{B}}^e(v,u)\wedge \forall y:(\neg {\pi }_{\mathsf{B}}^e(v,y)\wedge \neg F(v,y))\vee \neg {\pi }_{\mathsf{B}}^t(v,y,u)\wedge$	4
			$\neg {\pi }_{\mathsf{B}}^i(u,v)\wedge \forall x:(\neg {\pi }_{\mathsf{B}}^i(u,x)\wedge \neg F(x,u))\vee \neg {\pi }_{\mathsf{B}}^t(u,v,x)$
	$\neg F(u,v)$	⇒	$\neg {\pi }_{\mathsf{B}}^i(v,u)\wedge \forall y:(\neg {\pi }_{\mathsf{B}}^i(v,y)\wedge \neg F(y,v))\vee \neg {\pi }_{\mathsf{B}}^t(v,u,y)\vee$
			$\neg {\pi }_{\mathsf{B}}^e(u,v)\wedge \forall x:(\neg {\pi }_{\mathsf{B}}^e(u,x)\wedge \neg F(u,x))\vee \neg {\pi }_{\mathsf{B}}^t(u,x,v)$
$H\in {\mathsf{B}}^{\neg \leftarrow }$	$F(u,v)$	⇒	$\neg {\pi }_{\mathsf{B}}^i(v,u)\wedge \forall y:(\neg {\pi }_{\mathsf{B}}^i(v,y)\wedge F(y,v))\vee \neg {\pi }_{\mathsf{B}}^t(v,u,y)\vee$	4
			$\neg {\pi }_{\mathsf{B}}^e(u,v)\wedge \forall x:(\neg {\pi }_{\mathsf{B}}^e(u,x)\wedge F(u,x))\vee \neg {\pi }_{\mathsf{B}}^t(u,x,v)$
	$\neg F(u,v)$	⇒	$F(v,u)\wedge \neg {\pi }_{\mathsf{B}}^e(v,u)\wedge \forall y:(\neg {\pi }_{\mathsf{B}}^e(v,y)\wedge F(v,y))\vee \neg {\pi }_{\mathsf{B}}^t(v,y,u)\wedge$
			$\neg {\pi }_{\mathsf{B}}^i(u,v)\wedge \forall x:(\neg {\pi }_{\mathsf{B}}^i(u,x)\neg F(x,u))\vee \neg {\pi }_{\mathsf{B}}^t(u,v,x)$

for that transformation.

Proof. 

Two implication directions “⇒” and “⇐” have to be shown.

The idea of the proof is only sketched here and the detailed proof is given in the Appendix. To show the direction ⇒, we start with a graph $H=(V,F)\in {\mathsf{B}}^{\gamma }$. For each graph H there exists at least one graph $G=(V,E)\in \mathsf{B}$ with $H=G^{\gamma }$. Then, the conditions for the predicates of such an graph G are derived in terms of the predicates. To show the direction ⇐, we have a graph $H=(V,F)$ such that the edge inclusion and exclusion implications depicted for ${\mathsf{B}}^{\gamma }$ in the according Table are satisfied. We construct a graph $G=(V,E)$ such that $G\in \mathsf{B}$ and $G^{\gamma }=H$, which then implies $H\in {\mathsf{B}}^{\gamma }$.    □

4.3. Minimal Counter Examples

We are interested in solving the following problem: Assume that we have two graph classes, $\mathsf{A}$ and $\mathsf{B}$, defined by inclusion, exclusion and transfer axioms, and two transformations ${\gamma }_1$ and ${\gamma }_2$. We are interested in checking whether ${\gamma }_1\left(A\right)\subseteq {\gamma }_2\left(B\right)$.

In general, $\mathsf{A}⊈\gamma \left(\mathsf{B}\right)$, if there exists a graph $G=(V,E)\in \mathsf{A}$, which is not contained in $\gamma \left(\mathsf{B}\right)$. We term such graph a witness graph. Moreover, we term G a minimum witness graph if $\left|V\right|\le |V^{\prime }|$ for all witness graphs $G^{\prime }=(V^{\prime },E^{\prime })$. In general, a minimum witness graph is not necessarily unique.

The size of a minimum witness graph depends on the transformation $\gamma$ and the transformed class $\mathsf{B}$. As summarized in the next theorem, for the simple vertex preserving transformations in $\mathsf{\Gamma }$, with  Lemma 4 we obtain upper bounds on the number of vertices of a minimum witness graph. We term this value the maximum size of a minimum witness graph $\mu \left(\gamma \right)$.

Theorem 1.

Let ${\gamma }_1$ and ${\gamma }_2$ be any of the vertex preserving simple graph transformations in Γ. Let $\mathsf{A}$ and $\mathsf{B}$ be graph classes defined by inclusion, exclusion and transfer predicates, which satisfy Independency, Transitivity and Soundness (Assumptions 1–3). Let $\mu \left({\gamma }_2\right)$ as defined in Table 3 for transformation ${\gamma }_2$. ${\gamma }_1\left(\mathsf{A}\right)⊈{\gamma }_2\left(\mathsf{B}\right)$ if there exists a graph $G=(V,E)$ with $V\subseteq \mathsf{\Omega }$ and $\left|V\right|\le \mu \left({\gamma }_2\right)$, such that $G\in {\gamma }_1\left(\mathsf{A}\right)$ and $G\notin {\gamma }_2\left(\mathsf{B}\right)$.

Proof. 

With ${\gamma }_1\left(\mathsf{A}\right)⊈{\gamma }_2\left(\mathsf{B}\right)$ follows that there exists a graph $G=(V,E)$ with $V\subseteq \mathsf{\Omega }$ such that $G\in {\gamma }_1\left(\mathsf{A}\right)$ and $G\notin {\gamma }_2\left(\mathsf{B}\right)$. Consider such graph $G=(V,E)$, which is minimal in $\left|V\right|$. Assume $\left|V\right|>\mu \left({\gamma }_2\right)$.

Since $G\notin {\gamma }_2\left(\mathsf{B}\right)$, Lemma 4 implies that there exist $u_1,\dots ,u_{\mu \left({\gamma }_2\right)}$, such that at least one of the expressions for $F(u,v)$ or $\neg F(u,v)$ for transformation ${\gamma }_2$ in Table 3 is not satisfied.

Since $\left|V\right|>\mu \left({\gamma }_2\right)$, there exists a $y_0\in V$, which differs from $u_1,\dots ,u_{\mu \left({\gamma }_2\right)}$. Consider the subgraph $G^{\prime }$ induced by $V\setminus \left\{y_0\right\}$. All edges between vertices of $u_1,\dots ,u_{\mu \left({\gamma }_2\right)}$ exist in $G^{\prime }$ if they exist in G. Thus, at least one of the expressions for $F(u,v)$ or $\neg F(u,v)$ for transformation ${\gamma }_2$ does also not hold for $G^{\prime }$ and thus $G^{\prime }$ is not contained in ${\gamma }_2\left(\mathsf{B}\right)$.

However, with Lemma 2 the subgraph $G^{\prime }$ induced by $V\setminus \left\{y_0\right\}$ is a graph in ${\gamma }_1\left(\mathsf{A}\right)$. Since G was assumed to be minimal in $\left|V\right|$, graph $G^{\prime }$ must be contained in ${\gamma }_2\left(\mathsf{B}\right)$ (otherwise G would not be a minimum witness graph), a contradiction.    □

While for all transformations in $\mathsf{\Gamma }$, a minimum witness graph with at most four vertecies exists, this does not hold for the two transformations ${(·)}^{\oplus }$ and ${(·)}^{\neg \oplus }$.

Lemma 5.

The size of the minimum witness graph for the transformations ${(·)}^{\oplus }$ and ${(·)}^{\neg \oplus }$ is unbounded.

Proof. 

Assume the maximum size of a minimum witness graph for the transformation ${(·)}^{\oplus }$ is k. Consider a graph with $k+1$ vertices $V=\{v_1,\dots ,v_{k+1}\}$, where all edges $F(v_i,v_{i+1})$ for $i=\{1,...,k\}$ shall be included in the transformed graph. The predicate ${\pi }_{\mathsf{A}}^i(v_1,v_2)$ is true.

Furthermore, all predicates ${\pi }_{\mathsf{A}}^t(v_j,v_{j-1},v_{j+1})$ are true for j even and $2\le j\le k$ and all predicates ${\pi }_{\mathsf{A}}^t(v_j,v_{j+1},v_{j-1})$ are true for j odd and $3\le j\le k$.

Then, all edges $E(v_j,v_{j-1})$ and $E(v_j,v_{j+1})$ have to be set to $\mathrm{true}$ for j odd, while all edges $E(v_{j-1},v_j)$ and $E(v_{j+1},v_j)$ have to be set to $\mathrm{false}$ for j odd. The case of j even is here already covered.

If the inclusion predicate ${\pi }_{\mathsf{A}}^i(v_{k+1},v_k)$ is true if k is odd or the exclusion predicate ${\pi }_{\mathsf{A}}^e(v_{k+1},and{v}_k)$ is true if k is even, then there is no possibility to include all edges $v_i{v}_{i+1}$ for $i=\{1,\dots ,k\}$. However, if all other predicates are false, any subset of the edges $v_1,v_2,\dots ,v_k,v_{k+1}$ can be included. Therefore, the minimum size of a maximum witness graph is $k+1$ and since k was arbitrary, it is unbounded.

Analogously, the same construction yields that also the maximum size of a minimum witness graph for the negated ${(·)}^{\oplus }$ transformation is unbounded.    □

4.4. Expressions for Proving Subclass Relations

In this subsection, we consider different combinations of existing and non-existing edges. We provide formulas for the transformations in $\mathsf{\Gamma }$, such that if these formulas are true, then the considered combination of existing and non-existing edges is not possible for these transformations.

A combination of these formulas in negated and the non-negated form yields an expression for checking if one graph class is contained in another one or not. If not, the expression yields axioms for a counter example.

In the

Table 4. The expressions to be combined line-by-line as the nonnegated form on the left side and negated form on the right side to test for subclass relations.

$\mathit{\gamma }$	Edge Inclusion and Exclusion Implications
${(·)}^{\perp }$	${\rho }_{{\mathsf{B}}^{\perp }}^1(\left\{uv\right\},\{\varnothing \},V)$	=	$\mathrm{true}$
	${\rho }_{{\mathsf{B}}^{\perp }}^2(\{\varnothing \},\left\{uv\right\},V)$	=	$\mathrm{false}$
${(·)}^{\mathrm{id}}$	${\rho }_{\mathsf{B}}^1(\left\{uv\right\},\{\varnothing \},V)$	=	${\pi }_{\mathsf{B}}^e(u,v)$
	${\rho }_{\mathsf{B}}^2(\{\varnothing \},\left\{uv\right\},V)$	=	${\pi }_{\mathsf{B}}^i(u,v)$
	${\rho }_{\mathsf{B}}^3(\{uv,vu\},\{\varnothing \},V)$	=	${\rho }_{\mathsf{B}}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{\mathsf{B}}^1(\left\{vu\right\},\{\varnothing \},V)$
	${\rho }_{\mathsf{B}}^4(\{\varnothing \},\{uv,vu\},V)$	=	${\rho }_{\mathsf{B}}^2(\{\varnothing \},\left\{uv\right\},V)\vee {\rho }_{\mathsf{B}}^2(\{\varnothing \},\left\{vu\right\},V)$
	${\rho }_{\mathsf{B}}^5(\left\{uv\right\},\left\{vu\right\},V)$	=	${\rho }_{\mathsf{B}}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{\mathsf{B}}^2(\{\varnothing \},\left\{vu\right\},V)$
	${\rho }_{\mathsf{B}}^6(\left\{uv\right\},\left\{uw\right\},V)$	=	${\rho }_{\mathsf{B}}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{\mathsf{B}}^2(\{\varnothing \},\left\{uw\right\},V)\vee {\pi }_{\mathsf{B}}^t(u,w,v)\vee v=w$
	${\rho }_{\mathsf{B}}^7(\left\{vu\right\},\left\{wu\right\},V)$	=	${\rho }_{\mathsf{B}}^1(\left\{vu\right\},\{\varnothing \},V)\vee {\rho }_{\mathsf{B}}^2(\{\varnothing \},\left\{wu\right\},V)\vee v=w$
	${\rho }_{\mathsf{B}}^8(\{uv,vw\},\{\varnothing \},V)$	=	${\rho }_{\mathsf{B}}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{\mathsf{B}}^1(\left\{vw\right\},\{\varnothing \},V)$
	${\rho }_{\mathsf{B}}^9(\{\varnothing \},\{uv,vw\},V)$	=	${\rho }_{\mathsf{B}}^2(\{\varnothing \},\left\{uv\right\},V)\vee {\rho }_{\mathsf{B}}^2(\{\varnothing \},\left\{vw\right\},V)$
	${\rho }_{\mathsf{B}}^{10}(\{uv,wx\},\left\{wv\right\},V)$	=	${\rho }_{\mathsf{B}}^7(\left\{uv\right\},\left\{wv\right\},V)\vee {\rho }_{\mathsf{B}}^6(\left\{wx\right\},\left\{wv\right\},V)\vee u=w\vee v=x$
	${\rho }_{\mathsf{B}}^{11}(\left\{wv\right\},\{uv,wx\},V)$	=	${\rho }_{\mathsf{B}}^7(\left\{wv\right\},\left\{uv\right\},V)\vee {\rho }_{\mathsf{B}}^6(\left\{wv\right\},\left\{wx\right\},V)\vee u=w\vee v=x$
${(·)}^{+}$	${\rho }_{{\mathsf{B}}^{+}}^1(\left\{uv\right\},\{\varnothing \},V)$	=	${\pi }_{\mathsf{B}}^e(u,v)\wedge {\pi }_{\mathsf{B}}^e(v,u)$
	${\rho }_{{\mathsf{B}}^{+}}^2(\{\varnothing \},\left\{uv\right\},V)$	=	${\pi }_{\mathsf{B}}^i(u,v)\vee {\pi }_{\mathsf{B}}^i(v,u)$
	${\rho }_{{\mathsf{B}}^{+}}^3(\{uv,vu\},\{\varnothing \},V)$	=	${\rho }_{{\mathsf{B}}^{+}}^1(\left\{uv\right\},\{\varnothing \},V)$
	${\rho }_{{\mathsf{B}}^{+}}^4(\{\varnothing \},\{uv,vu\},V)$	=	${\rho }_{{\mathsf{B}}^{+}}^2(\{\varnothing \},\left\{uv\right\},V)$
	${\rho }_{{\mathsf{B}}^{+}}^5(\left\{uv\right\},\left\{vu\right\},V)$	=	$\mathrm{true}$
	${\rho }_{{\mathsf{B}}^{+}}^6(\left\{uv\right\},\left\{uw\right\},V)$	=	${\rho }_{{\mathsf{B}}^{+}}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{+}}^2(\{\varnothing \},\left\{uw\right\},V)\vee$
			$({\pi }_{\mathsf{B}}^t(u,w,v)\wedge {\pi }_{\mathsf{B}}^e(v,u))\vee v=w$
	${\rho }_{{\mathsf{B}}^{+}}^7(\left\{vu\right\},\left\{wu\right\},V)$	=	${\rho }_{{\mathsf{B}}^{+}}^6(\left\{uv\right\},\left\{uw\right\},V)$
	${\rho }_{{\mathsf{B}}^{+}}^8(\{uv,vw\},\{\varnothing \},V)$	=	${\rho }_{{\mathsf{B}}^{+}}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{+}}^1(\left\{vw\right\},\{\varnothing \},V)$
	${\rho }_{{\mathsf{B}}^{+}}^9(\{\varnothing \},\{uv,vw\},V)$	=	${\rho }_{{\mathsf{B}}^{+}}^2(\{\varnothing \},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{+}}^2(\{\varnothing \},\left\{vw\right\},V)$
	${\rho }_{{\mathsf{B}}^{+}}^{10}(\{uv,wx\},\left\{wv\right\},V)$	=	${\rho }_{{\mathsf{B}}^{+}}^7(\left\{uv\right\},\left\{wv\right\},V)\vee {\rho }_{{\mathsf{B}}^{+}}^6(\left\{wx\right\},\left\{wv\right\},V)\vee u=w\vee v=x$
	${\rho }_{{\mathsf{B}}^{+}}^{11}(\left\{wv\right\},\{uv,wx\},V)$	=	${\rho }_{{\mathsf{B}}^{+}}^7(\left\{wv\right\},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{+}}^6(\left\{wv\right\},\left\{wx\right\},V)\vee$
			$({\pi }_{\mathsf{B}}^t(v,u,w)\wedge {\pi }_{\mathsf{B}}^t(w,x,v))\vee u=w\vee v=x$
${(·)}^{-}$	${\rho }_{{\mathsf{B}}^{-}}^1(\left\{uv\right\},\{\varnothing \},V)$	=	${\pi }_{\mathsf{B}}^e(u,v)\vee {\pi }_{\mathsf{B}}^e(v,u)$
	${\rho }_{{\mathsf{B}}^{-}}^2(\{\varnothing \},\left\{uv\right\},V)$	=	${\pi }_{\mathsf{B}}^i(u,v)\wedge {\pi }_{\mathsf{B}}^i(v,u)$
	${\rho }_{{\mathsf{B}}^{-}}^3(\{uv,vu\},\{\varnothing \},V)$	=	${\rho }_{{\mathsf{B}}^{-}}^1(\left\{uv\right\},\{\varnothing \},V)$
	${\rho }_{{\mathsf{B}}^{-}}^4(\{\varnothing \},\{uv,vu\},V)$	=	${\rho }_{{\mathsf{B}}^{-}}^2(\{\varnothing \},\left\{uv\right\},V)$
	${\rho }_{{\mathsf{B}}^{-}}^5(\left\{uv\right\},\left\{vu\right\},V)$	=	$\mathrm{true}$
	${\rho }_{{\mathsf{B}}^{-}}^6(\left\{uv\right\},\left\{uw\right\},V)$	=	${\rho }_{{\mathsf{B}}^{-}}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{-}}^2(\{\varnothing \},\left\{uw\right\},V)\vee$
			$({\pi }_{\mathsf{B}}^t(u,w,v)\wedge {\pi }_{\mathsf{B}}^i(w,u))\vee v=w$
	${\rho }_{{\mathsf{B}}^{-}}^7(\left\{vu\right\},\left\{wu\right\},V)$	=	${\rho }_{{\mathsf{B}}^{-}}^6(\left\{uv\right\},\left\{uw\right\},V)$
	${\rho }_{{\mathsf{B}}^{-}}^8(\{uv,vw\},\{\varnothing \},V)$	=	${\rho }_{{\mathsf{B}}^{-}}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{-}}^1(\left\{vw\right\},\{\varnothing \},V)$
	${\rho }_{{\mathsf{B}}^{-}}^9(\{\varnothing \},\{uv,vw\},V)$	=	${\rho }_{{\mathsf{B}}^{-}}^2(\{\varnothing \},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{-}}^2(\{\varnothing \},\left\{vw\right\},V)$
	${\rho }_{{\mathsf{B}}^{-}}^{10}(\{uv,wx\},\left\{wv\right\},V)$	=	${\rho }_{{\mathsf{B}}^{-}}^7(\left\{uv\right\},\left\{wv\right\},V)\vee {\rho }_{{\mathsf{B}}^{-}}^6(\left\{wx\right\},\left\{wv\right\},V)\vee$
			$({\pi }_{\mathsf{B}}^t(v,w,u)\wedge {\pi }_{\mathsf{B}}^t(w,v,x))\vee u=w\vee v=x$
	${\rho }_{{\mathsf{B}}^{-}}^{11}(\left\{wv\right\},\{uv,wx\},V)$	=	${\rho }_{{\mathsf{B}}^{-}}^7(\left\{wv\right\},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{-}}^6(\left\{wv\right\},\left\{wx\right\},V)$$\vee u=w\vee v=x$

and

Table 5. The expressions to be combined line-by-line as a nonnegated form on the left side and negated form on the right side to test for subclass relations.

$\mathit{\gamma }$	Edge Inclusion and Exclusion Implications
${(·)}^{\leftrightarrow }$	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^1(\left\{uv\right\},\{\varnothing \},V)$	=	${\pi }_{\mathsf{B}}^e(v,u)$
	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^2(\{\varnothing \},\left\{uv\right\},V)$	=	${\pi }_{\mathsf{B}}^i(v,u)$
	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^3(\{uv,vu\},\{\varnothing \},V)$	=	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{\leftrightarrow }}^1(\left\{vu\right\},\{\varnothing \},V)$
	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^4(\{\varnothing \},\{uv,vu\},V)$	=	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^2(\{\varnothing \},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\leftrightarrow }}^2(\{\varnothing \},\left\{vu\right\},V)$
	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^5(\left\{uv\right\},\left\{vu\right\},V)$	=	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{\leftrightarrow }}^2(\{\varnothing \},\left\{vu\right\},V)$
	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^6(\left\{uv\right\},\left\{uw\right\},V)$	=	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{\leftrightarrow }}^2(\{\varnothing \},\left\{uw\right\},V)\vee v=w$
	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^7(\left\{vu\right\},\left\{wu\right\},V)$	=	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^1(\left\{vu\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{\leftrightarrow }}^2(\{\varnothing \},\left\{wu\right\},V)\vee {\pi }_{\mathsf{B}}^t(u,w,v)\vee v=w$
	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^8(\{uv,vw\},\{\varnothing \},V)$	=	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{\leftrightarrow }}^1(\left\{vw\right\},\{\varnothing \},V)$
	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^9(\{\varnothing \},\{uv,vw\},V)$	=	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^2(\{\varnothing \},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\leftrightarrow }}^2(\{\varnothing \},\left\{vw\right\},V)$
	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^{10}(\{uv,wx\},\left\{wv\right\},V)$	=	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^7(\left\{uv\right\},\left\{wv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\leftrightarrow }}^6(\left\{wx\right\},\left\{wv\right\},V)\vee u=w\vee v=x$
	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^{11}(\left\{wv\right\},\{uv,wx\},V)$	=	${\rho }_{{\mathsf{B}}^{\leftrightarrow }}^7(\left\{wv\right\},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\leftrightarrow }}^6(\left\{wv\right\},\left\{wx\right\},V)\vee u=w\vee v=x$
${(·)}^{\to }$	${\rho }_{{\mathsf{B}}^{\to }}^1(\left\{uv\right\},\{\varnothing \},V)$	=	${\pi }_{\mathsf{B}}^e(u,v)\vee {\pi }_{\mathsf{B}}^i(v,u)$
	${\rho }_{{\mathsf{B}}^{\to }}^2(\{\varnothing \},\left\{uv\right\},V)$	=	${\pi }_{\mathsf{B}}^i(u,v)\wedge {\pi }_{\mathsf{B}}^e(v,u)$
	${\rho }_{{\mathsf{B}}^{\to }}^3(\{uv,vu\},\{\varnothing \},V)$	=	$\mathrm{true}$
	${\rho }_{{\mathsf{B}}^{\to }}^4(\{\varnothing \},\{uv,vu\},V)$	=	${\rho }_{{\mathsf{B}}^{\to }}^2(\{\varnothing \},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\to }}^2(\{\varnothing \},\left\{vu\right\},V)$
	${\rho }_{{\mathsf{B}}^{\to }}^5(\left\{uv\right\},\left\{vu\right\},V)$	=	${\rho }_{{\mathsf{B}}^{\to }}^1(\left\{uv\right\},\{\varnothing \},V)$
	${\rho }_{{\mathsf{B}}^{\to }}^6(\left\{uv\right\},\left\{uw\right\},V)$	=	${\rho }_{{\mathsf{B}}^{\to }}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{\to }}^2(\{\varnothing \},\left\{uw\right\},V)\vee$
			$({\pi }_{\mathsf{B}}^t(u,w,v)\wedge {\pi }_{\mathsf{B}}^e(w,u))\vee v=w$
	${\rho }_{{\mathsf{B}}^{\to }}^7(\left\{vu\right\},\left\{wu\right\},V)$	=	${\rho }_{{\mathsf{B}}^{\to }}^1(\left\{vu\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{\to }}^2(\{\varnothing \},\left\{wu\right\},V)\vee$
			$({\pi }_{\mathsf{B}}^t(u,v,w)\wedge {\pi }_{\mathsf{B}}^i(w,u))\vee v=w$
	${\rho }_{{\mathsf{B}}^{\to }}^8(\{uv,vw\},\{\varnothing \},V)$	=	${\rho }_{{\mathsf{B}}^{\to }}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{\to }}^1(\left\{vw\right\},\{\varnothing \},V)\vee {\pi }_{\mathsf{B}}^t(v,u,w)\vee u=w$
	${\rho }_{{\mathsf{B}}^{\to }}^9(\{\varnothing \},\{uv,vw\},V)$	=	${\rho }_{{\mathsf{B}}^{\to }}^2(\{\varnothing \},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\to }}^2(\{\varnothing \},\left\{vw\right\},V)\vee$
			${\pi }_{\mathsf{B}}^i(u,v)\wedge {\pi }_{\mathsf{B}}^e(w,v)\wedge {\pi }_{\mathsf{B}}^t(v,w,u)$
	${\rho }_{{\mathsf{B}}^{\to }}^{10}(\{uv,wx\},\left\{wv\right\},V)$	=	${\rho }_{{\mathsf{B}}^{\to }}^7(\left\{uv\right\},\left\{wv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\to }}^6(\left\{wx\right\},\left\{wv\right\},V)\vee$
			$({\pi }_{\mathsf{B}}^t(v,u,w)\wedge {\pi }_{\mathsf{B}}^t(w,v,x))\vee u=w\vee v=x$
	${\rho }_{{\mathsf{B}}^{\to }}^{11}(\left\{wv\right\},\{uv,wx\},V)$	=	${\rho }_{{\mathsf{B}}^{\to }}^7(\left\{wv\right\},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\to }}^6(\left\{wv\right\},\left\{wx\right\},V)\vee u=w\vee v=x$
${(·)}^{\leftarrow }$	${\rho }_{{\mathsf{B}}^{\leftarrow }}^1(\left\{uv\right\},\{\varnothing \},V)$	=	${\pi }_{\mathsf{B}}^i(u,v)\vee {\pi }_{\mathsf{B}}^e(v,u)$
	${\rho }_{{\mathsf{B}}^{\leftarrow }}^2(\{\varnothing \},\left\{uv\right\},V)$	=	${\pi }_{\mathsf{B}}^e(u,v)\wedge {\pi }_{\mathsf{B}}^i(v,u)$
	${\rho }_{{\mathsf{B}}^{\leftarrow }}^3(\{uv,vu\},\{\varnothing \},V)$	=	$\mathrm{true}$
	${\rho }_{{\mathsf{B}}^{\leftarrow }}^4(\{\varnothing \},\{uv,vu\},V)$	=	${\rho }_{{\mathsf{B}}^{\leftarrow }}^2(\{\varnothing \},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\leftarrow }}^2(\{\varnothing \},\left\{vu\right\},V)$
	${\rho }_{{\mathsf{B}}^{\leftarrow }}^5(\left\{uv\right\},\left\{vu\right\},V)$	=	${\rho }_{{\mathsf{B}}^{\leftarrow }}^1(\left\{uv\right\},\{\varnothing \},V)$
	${\rho }_{{\mathsf{B}}^{\leftarrow }}^6(\left\{uv\right\},\left\{uw\right\},V)$	=	${\rho }_{{\mathsf{B}}^{\leftarrow }}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{\leftarrow }}^2(\{\varnothing \},\left\{uw\right\},V)\vee$
			$({\pi }_{\mathsf{B}}^t(u,v,w)\wedge {\pi }_{\mathsf{B}}^i(u,w))\vee v=w$
	${\rho }_{{\mathsf{B}}^{\leftarrow }}^7(\left\{vu\right\},\left\{wu\right\},V)$	=	${\rho }_{{\mathsf{B}}^{\leftarrow }}^1(\left\{vu\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{\leftarrow }}^2(\{\varnothing \},\left\{wu\right\},V)\vee$
			$({\pi }_{\mathsf{B}}^t(u,w,v)\wedge {\pi }_{\mathsf{B}}^e(w,u))\vee v=w$
	${\rho }_{{\mathsf{B}}^{\leftarrow }}^8(\{uv,vw\},\{\varnothing \},V)$	=	${\rho }_{{\mathsf{B}}^{\leftarrow }}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{\leftarrow }}^1(\left\{vw\right\},\{\varnothing \},V)\vee {\pi }_{\mathsf{B}}^t(v,w,u)\vee u=w$
	${\rho }_{{\mathsf{B}}^{\leftarrow }}^9(\{\varnothing \},\{uv,vw\},V)$	=	${\rho }_{{\mathsf{B}}^{\leftarrow }}^2(\{\varnothing \},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\leftarrow }}^2(\{\varnothing \},\left\{vw\right\},V)\vee$
			${\pi }_{\mathsf{B}}^e(u,v)\wedge {\pi }_{\mathsf{B}}^i(w,v)\wedge {\pi }_{\mathsf{B}}^t(v,u,w)$
	${\rho }_{{\mathsf{B}}^{\leftarrow }}^{10}(\{uv,wx\},\left\{wv\right\},V)$	=	${\rho }_{{\mathsf{B}}^{\leftarrow }}^7(\left\{uv\right\},\left\{wv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\leftarrow }}^6(\left\{wx\right\},\left\{wv\right\},V)\vee$
			$({\pi }_{\mathsf{B}}^t(v,w,u)\wedge {\pi }_{\mathsf{B}}^t(w,x,v))\vee u=w\vee v=x$
	${\rho }_{{\mathsf{B}}^{\leftarrow }}^{11}(\left\{wv\right\},\{uv,wx\},V)$	=	${\rho }_{{\mathsf{B}}^{\leftarrow }}^7(\left\{wv\right\},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\leftarrow }}^6(\left\{wv\right\},\left\{wx\right\},V)\vee u=w\vee v=x$

, we only list the expressions for the non-negated transformations. The expressions for negated transformations can be obtained by changing the sets of existing and non-existing edges. With the color coding defined in Figure 1 we illustrate some of the expressions in Figure 2a,b and Figure 3.

Theorem 2.

Let ${\gamma }_1$ and ${\gamma }_2$ be two of the vertex preserving simple graph transformations in Γ. Let $\mathsf{A}$ and $\mathsf{B}$ be graph classes defined by inclusion, exclusion and transfer predicates satisfying Independence, Transitivity and Soundness (Assumptions 1–3). Let ${\rho }_{{\gamma }_1\left(\mathsf{A}\right)}^k(·,·)$ resp. ${\rho }_{{\gamma }_2\left(\mathsf{B}\right)}^k(·,·)$ be the expressions listed in Table 4 resp. Table 5 for ${\gamma }_1$ and ${\gamma }_2$. Moreover, let $\mu \left({\gamma }_2\right)$ be the maximum size of a minimum witness graph as defined for ${\gamma }_2$ in Table 3. It holds: ${\gamma }_1\left(\mathsf{A}\right)⊈{\gamma }_2\left(\mathsf{B}\right)$ if there exists a graph $H=(V,F)$ with $\left|V\right|\le \mu \left({\gamma }_2\right)$ such that

$$\begin{array}{c}\hfill \underset{k=1}{\overset{11}{\bigvee }}\neg {\rho }_{{\gamma }_1\left(\mathsf{A}\right)}^k(S^k,T^k)\wedge {\rho }_{{\gamma }_2\left(\mathsf{B}\right)}^k(S^k,T^k)\end{array}$$

(6)

is satisfied, where $S^k$ and $T^k$ are specific subsets $S^k\subseteq F$ and $T^k\subseteq V\times V\setminus F$, as defined in the Table 4 and Table 5 and V is the vertex set of H for each ${\rho }_{\mathsf{X}}^k(·,·)$ expression.

Proof. 

Theorem 1 states that ${\gamma }_1\left(\mathsf{A}\right)⊈{\gamma }_2\left(\mathsf{B}\right)$ is satisfied if there exists a counter example with a size, at most $\mu \left({\gamma }_2\right)$.

To obtain a graph H such that $H\in {\gamma }_1\left(A\right)$, but $H\notin {\gamma }_2\left(B\right)$, for the expressions listed in Table 4 resp. Table 5, ${\rho }_{{\gamma }_1\left(A\right)}^k(S^k,T^k)$ has to be non-satisfiable, but ${\rho }_{{\gamma }_2\left(B\right)}^k(S^k,T^k)$ has to be satisfiable. Hereby, $G=(V,E)$ is the graph before considering the graph transformations and ${\rho }_{\mathsf{X}}^k(S^k,T^k)$ means that it is not possible to include all edges in $S^k$, while excluding all edges in $T^k$. Consequently, $\neg {\rho }_{\mathsf{X}}^k(S^k,T^k)$ means that it is possible to include all edges in $S^k$, while excluding all edges in $T^k$.

The expressions can be derived by the conjunction of the expressions for graph class transformation X in Table 3. For the edges in $S_k$, the expression for $F(u,v)$ has to be used, while for the edges in $T_k$ the expression for $\neg F(u,v)$ has to be used. The expressions we derive in this way refer to the case that it is possible to include the edges in $S_k$, while excluding the edges in $T_k$ and therefore yields an expression for $\neg {\rho }_{\mathsf{X}}^k(S^k,T^k)$. Negating $\neg {\rho }_{\mathsf{X}}^k(S^k,T^k)$ yields the expression for ${\rho }_{\mathsf{X}}^k(S^k,T^k)$, given in Table 4 resp. Table 5. The expressions for the negated transformations can be obtained by switching the sets $S_k$ and $T_k$.    □

The expression of Theorem 2 simplifies significantly when testing ${\mathsf{A}}^{-}⊈{\mathsf{A}}^{+}$ or ${\mathsf{A}}^{+}⊈{\mathsf{A}}^{-}$ and if the predicates safisfy two additional properties called predicate-symetric and predicate-forwarding.

Definition 3.

A graph class A is called predicate-symmetric if $\forall u,v\in V:{\pi }_{\mathsf{A}}^i(u,v)\iff {\pi }_{\mathsf{A}}^i(v,u)$ and ${\pi }_{\mathsf{A}}^e(u,v)\iff {\pi }_{\mathsf{A}}^e(v,u)$ holds.

Definition 4.

A graph class A is called predicate-forwarding if $\forall u,v,w\in V:{\pi }_{\mathsf{A}}^i(u,v)\wedge {\pi }_{\mathsf{A}}^t(u,w,v)\iff {\pi }_{\mathsf{A}}^i(u,w)$ and ${\pi }_{\mathsf{A}}^e(u,v)\wedge {\pi }_{\mathsf{A}}^t(u,v,w)\iff {\pi }_{\mathsf{A}}^e(u,w)$ holds.

Obviously, predicate-symmetric and predicate-forwarding graph classes can still satisfy Independence, Transitivity and Soundness (Assumptions 1–3).

The graph classes of the application described in Section 2, are predicate–symmetric and predicate-forwarding.

Corollary 1.

Let $\mathsf{A}$ be a predicate–symmetric and predicate-forwarding graph class defined by inclusion, exclusion and transfer axioms, satisfying Independency, Transitivity and Soundness (Assumptions 1–3). We have: ${\mathsf{A}}^{-}⊈{\mathsf{A}}^{+}$ iff

$$\begin{array}{c}\hfill \neg {\pi }_{\mathsf{A}}^e(v,w)\wedge \neg {\pi }_{\mathsf{A}}^i(u,v)\wedge \neg {\pi }_{\mathsf{A}}^i(w,x)\wedge \\ \hfill {\pi }_{\mathsf{A}}^t(v,u,w)\wedge {\pi }_{\mathsf{A}}^t(w,x,v)\end{array}$$

(7)

and ${\mathsf{A}}^{+}⊈{\mathsf{A}}^{-}$ iff

$$\begin{array}{c}\hfill \neg {\pi }_{\mathsf{A}}^i(v,w)\wedge \neg {\pi }_{\mathsf{A}}^e(u,v)\wedge \neg {\pi }_{\mathsf{A}}^e(w,x)\wedge \\ \hfill {\pi }_{\mathsf{A}}^t(v,w,u)\wedge {\pi }_{\mathsf{A}}^t(w,v,x)\end{array}$$

(8)

is satisfied for some $u,v,w,x$.

Corollary 2.

For predicate–symmetric and predicate-forwarding graph classes $\mathsf{A}$ Theorem 2 can also be applied for the transformations $A^{\oplus }$ and $A^{\neg \oplus }$ by using the following ${\rho }_i$ expressions:

$$\begin{array}{cc}\hfill {\rho }_{{\mathsf{B}}^{\oplus }}^1(\left\{uv\right\},\{\varnothing \},V)& ={\pi }_{\mathsf{B}}^e(u,v)\vee {\pi }_{\mathsf{B}}^i(u,v)\hfill \\ \hfill {\rho }_{{\mathsf{B}}^{\oplus }}^2(\{\varnothing \},\left\{uv\right\},V)& =\mathrm{false}\hfill \\ \hfill {\rho }_{{\mathsf{B}}^{\oplus }}^3(\{uv,vu\},\{\varnothing \},V)& ={\rho }_{{\mathsf{B}}^{\oplus }}^1(\left\{uv\right\},\{\varnothing \},V)\hfill \\ \hfill {\rho }_{{\mathsf{B}}^{\oplus }}^4(\{\varnothing \},\{uv,vu\},V)& ={\rho }_{{\mathsf{B}}^{\oplus }}^2(\{\varnothing \},\left\{uv\right\},V)\hfill \\ \hfill {\rho }_{{\mathsf{B}}^{\oplus }}^5(\left\{uv\right\},\left\{vu\right\},V)& =\mathrm{true}\hfill \\ \hfill {\rho }_{{\mathsf{B}}^{\oplus }}^6(\left\{uv\right\},\left\{uw\right\},V)& ={\rho }_{{\mathsf{B}}^{\oplus }}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{\oplus }}^2(\{\varnothing \},\left\{uw\right\},V)\vee v=w\hfill \\ \hfill {\rho }_{{\mathsf{B}}^{\oplus }}^7(\left\{vu\right\},\left\{wu\right\},V)& ={\rho }_{{\mathsf{B}}^{\oplus }}^1(\left\{vu\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{\oplus }}^2(\{\varnothing \},\left\{wu\right\},V)\vee v=w\hfill \\ \hfill {\rho }_{{\mathsf{B}}^{\oplus }}^8(\{uv,vw\},\{\varnothing \},V)& ={\rho }_{{\mathsf{B}}^{\oplus }}^1(\left\{uv\right\},\{\varnothing \},V)\vee {\rho }_{{\mathsf{B}}^{\oplus }}^1(\left\{vw\right\},\{\varnothing \},V)\hfill \\ \hfill {\rho }_{{\mathsf{B}}^{\oplus }}^9(\{\varnothing \},\{uv,vw\},V)& ={\rho }_{{\mathsf{B}}^{\oplus }}^2(\{\varnothing \},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\oplus }}^2(\{\varnothing \},\left\{vw\right\},V)\hfill \\ \hfill {\rho }_{{\mathsf{B}}^{\oplus }}^{10}(\{uv,wx\},\left\{wv\right\},V)& ={\rho }_{{\mathsf{B}}^{\oplus }}^7(\left\{uv\right\},\left\{wv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\oplus }}^6(\left\{wx\right\},\left\{wv\right\},V)\vee u=w\vee v=x\hfill \\ \hfill {\rho }_{{\mathsf{B}}^{\oplus }}^{11}(\left\{wv\right\},\{uv,wx\},V)& ={\rho }_{{\mathsf{B}}^{\oplus }}^7(\left\{wv\right\},\left\{uv\right\},V)\vee {\rho }_{{\mathsf{B}}^{\oplus }}^6(\left\{wv\right\},\left\{wx\right\},V)\vee u=w\vee v=x\hfill \end{array}$$

Proof. 

We have to derive the appropriate expressions for Lemma 4 for this specific case.

If ${\pi }_{\mathsf{B}}^i(u,v)$ holds, then by the symmetry of the predicates also ${\pi }_{\mathsf{B}}^i(v,u)$ holds and then $E(u,v)$ and $E(v,u)$ have to be set to $\mathrm{true}$. This yields $\neg F(u,v)$. Analogously, if ${\pi }_{\mathsf{B}}^e(u,v)$ holds, then by the symmetry of the predicates also ${\pi }_{\mathsf{B}}^e(v,u)$ holds and then $E(u,v)$ and $E(v,u)$ are both set to $\mathrm{false}$, i.e., $\neg E(u,v)$ and $\neg E(v,u)$ holds. This also yields $\neg F(u,v)$. Since the predicates are furthermore predicate-forwarding, predicates for other edges have no impact on the existence of the edges $E(u,v)$ and $E(v,u)$. Furthermore, neither $E(u,v)$ nor $\neg E(u,v)$ implies $F(u,v)$, $\neg F(u,v)$, $F(v,u)$, $\neg F(v,u)$. The only further condition we have to consider is the symmetry of F. Finally, this yields

$$F(u,v)\Rightarrow F(v,u)\wedge \neg {\pi }_{\mathsf{B}}^i(u,v)\neg {\pi }_{\mathsf{B}}^e(u,v),$$

while no restrictions exist for $\neg F(u,x)$.

This yields ${\rho }_{{\mathsf{B}}^{\oplus }}^1(\left\{uv\right\},\{\varnothing \},V)={\pi }_{\mathsf{B}}^e(u,v)\vee {\pi }_{\mathsf{B}}^i(u,v)$, ${\rho }_{{\mathsf{B}}^{\oplus }}^2(\{\varnothing \},\left\{uv\right\},V)=\mathrm{false}$ and ${\rho }_{{\mathsf{B}}^{\oplus }}^5(\left\{uv\right\},\left\{vu\right\},V)$ = $\mathrm{true}$. Due to the symmetry of the transformations, i.e., any edge $uv$ exists if and only if edge $vu$ exists, the reaming ${\rho }^i$ expressions follow identically by the method applied in Theorem 2.    □

5. Example Application

5.1. Manual Application of the Derived Concept

We first illustrate the presented concept manually by applying it to the graph classes discussed in Section 2. We use the concept to demonstrate that the class ${\left(\mathsf{QUDG}\left(r\right)\right)}^{-}$ is the same as class ${\left(\mathsf{QUDG}\left(r\right)\right)}^{+}$ (as already discussed). Moreover, we apply the concept to show that the classes ${\left(\mathsf{DTG}\left(r\right)\right)}^{-}$ and ${\left(\mathsf{DTG}\left(r\right)\right)}^{+}$ studied in the literature are in fact classes, with none being contained in the other one.

The inclusion predicate $\mathsf{MinDG}\left(r\right)$ and exclusion predicate $\mathsf{MaxDG}\left(\mathsf{r}\right)$ are obviously symmetric, as long as $d(u,v)$ is symmetric (which we assume for this example). The class $\mathsf{QUDG}\left(r\right)$ has an inclusion and exclusion but no transfer predicate, i.e., the transfer predicate is always $\mathrm{false}$. Thus, for testing ${\left(\mathsf{QUDG}\left(r\right)\right)}^{-}⊈{\left(\mathsf{QUDG}\left(r\right)\right)}^{+}$ and ${\left(\mathsf{QUDG}\left(r\right)\right)}^{+}⊈{\left(\mathsf{QUDG}\left(r\right)\right)}^{-}$, neither (7) nor (8) of Corollary 1 are satisfied. Thus, both inclusions must be satisfied, and we have in fact the equality of both graph classes.

Now, the relation between ${\left(\mathsf{DTG}\left(r\right)\right)}^{+}$ and ${\left(\mathsf{DTG}\left(r\right)\right)}^{-}$ is considered. Applying Corollary 1 together with $\mathsf{DTG}\left(r\right)=\mathsf{MaxDG}\left(r\right)\cap \mathsf{CRG}$ (i.e., we have only exclusion and transfer predicate) we have to check the satisfiability of

$$\begin{array}{cc}\hfill (\neg d(v,w)>r)& \wedge (v\ne u\wedge d(v,u)\le d(v,w\left)\right)\hfill \\ & \wedge (w\ne x\wedge d(w,x)\le d(w,v\left)\right)\hfill \end{array}$$

for testing ${\left(\mathsf{DTG}\left(r\right)\right)}^{-}⊈{\left(\mathsf{DTG}\left(r\right)\right)}^{+}$ and

$$\begin{array}{cc}\hfill (\neg d(v,u)>r)& \wedge (\neg d(w,x)>r)\hfill \\ & \wedge (v\ne w\wedge d(v,w)\le d(v,u\left)\right)\hfill \\ \hfill & \wedge (w\ne v\wedge d(w,v)\le d(w,x\left)\right)\hfill \end{array}$$

for testing ${\left(\mathsf{DTG}\left(r\right)\right)}^{+}⊈{\left(\mathsf{DTG}\left(r\right)\right)}^{-}$.

This yields the counterexample $d(v,u)$, $d(w,x)\le d(v,w)\le r$, $u\ne v$, $w\ne x$, $u\ne w$ and $v\ne x$, which proves ${\left(\mathsf{DTG}\left(r\right)\right)}^{-}⊈{\left(\mathsf{DTG}\left(r\right)\right)}^{+}$. As well, this yields the counterexample $d(v,w)\le d(v,u)$, $d(w,x)\le r$, $v\ne w$, $u\ne w$ and $v\ne x$, which proves ${\left(\mathsf{DTG}\left(r\right)\right)}^{+}⊈{\left(\mathsf{DTG}\left(r\right)\right)}^{-}$. Thus, neither ${\left(\mathsf{DTG}\left(r\right)\right)}^{+}$ nor ${\left(\mathsf{DTG}\left(r\right)\right)}^{-}$ is contained in the other class. The according counterexamples can be found in Appendix B with the examples indexed: 52 and 53.

Now let us drop the assumption of the examples in Section 2, that $d(u,v)$ is a metric. Assume that $d(u,v)=d(v,u)$ is not required. In this case, the inclusion and exclusion predicate are not necessarily symmetric. Corollary 1 is not applicable. We have to resort to the Theorem 2. The relation between ${\left(\mathsf{QUDG}\left(r\right)\right)}^{-}$ and ${\left(\mathsf{QUDG}\left(r\right)\right)}^{+}$ is now considered again. For testing the relation ${\left(\mathsf{QUDG}\left(r\right)\right)}^{-}⊈{\left(\mathsf{QUDG}\right)}^{+}$, the second conjunction of expression (6) yields $\neg {\rho }_{{\mathsf{A}}^{-}}^2(\{\varnothing \},\left\{uv\right\})\wedge {\rho }_{{\mathsf{A}}^{+}}^2(\{\varnothing \},\left\{uv\right\})$. Replacing the formula with the predicates by using Table 4 yields $\left(\neg {\pi }_{\mathsf{A}}^i(u,v)\vee \neg {\pi }_{\mathsf{A}}^i(v,u)\right)\wedge \left({\pi }_{\mathsf{A}}^i(u,v)\vee {\pi }_{\mathsf{A}}^i(v,u)\right)=\left(\neg {\pi }_{\mathsf{A}}^i(u,v)\wedge {\pi }_{\mathsf{A}}^i(v,u)\right)\vee \left({\pi }_{\mathsf{A}}^i(u,v)\wedge \neg {\pi }_{\mathsf{A}}^i(v,u)\right)$.

This formula is satisfied if $d(u,v)<r$ and $d(v,u)\ge r$ or $d(u,v)\ge r$ and $d(v,u)<r$. Thus, we have found a counter example that the relation ${\left(\mathsf{QUDG}\left(r\right)\right)}^{-}={\left(\mathsf{QUDG}\left(r\right)\right)}^{+}$ does not necessarily hold when $d(u,v)$ is not a metric.

5.2. Automatically Derived Graph Class Relations

The tables in Appendix A show the automatically derived relations between all example geometric graph classes resulting from wireless networks, which we defined in Section 2. Since in this specific case the graph class axioms are predicate-symmetric and predicate-forwarding, we can also check for subclass relations, including the two xor transformations.

In case the relation does not hold, a counter example with at most four vertices can be found. We show the found counter examples in Appendix B. The counter examples are consecutively numbered and labeled with the expression ${\rho }^i$ (as defined by Table 4 and Table 5 and the negated forms) which led to unsatisfiability.

The tables in Appendix A are to be read from left to right as follows. Class in row i is related to class in column j according to table entry $(i,j)$, by relation:

=

The classes are the same

⊂

The class is contained in the other class but the classes are not the same

⊃

The class contains the other class but the classes are not the same

×

Neither of the two classes is contained in the others, (by lemmas 1 and 2 each of the studied graph classes contain at least the null graph. Thus, none of the considered graph classes are disjoint).

The relations ⊂, ⊃ and × in the tables are indexed with the numbered counter examples from Appendix B. Notation $\mathsf{C}{\subset }_n\mathsf{D}$ refers to the counter example number n, which shows that $\mathsf{D}$ is not contained in $\mathsf{C}$. Analogously, $\mathsf{C}{\supset }_n\mathsf{D}$ refers to the counter example number n, which shows that $\mathsf{C}$ is not contained in $\mathsf{D}$. Finally, $\mathsf{C}{\times }_n^m\mathsf{D}$ refers to the counter example n, which shows that $\mathsf{C}$ is not contained in $\mathsf{D}$ and the counter example m, which shows that $\mathsf{D}$ is not contained in $\mathsf{C}$.

The class name encoding in the tables in Appendix A is as defined at the beginning of the paper, summarized by the following Hasse diagram. To avoid clutter, the tables depict the graph classes without the fixed parameters r and 1.

Class $\mathsf{All}$ (not defined so far) means all of the predicates (i.e., inclusion, exclusion, and transfer) are $\mathrm{false}$. With all preconditions being false, all graphs satisfy inclusion, exclusion, and transfer predicate. Thus, the class just contains all graphs over the given vertex universe $\mathsf{\Omega }$.

Classes $\mathsf{MinDG}\left(r\right)$, $\mathsf{MaxDG}\left(1\right)$ and $\mathsf{CRG}$ are as already defined based only on inclusion, exclusion, and transfer predicate, respectively. All the remaining classes result from the intersection of the classes, which are predecessors in the diagram (observed from the top to bottom).

The class names $\mathsf{BG}\left(r\right)$ and $\mathsf{MDTG}\left(r\right)$ were not used before. We define them here for the sake of the completeness of the tables. For graphs in class $\mathsf{BG}\left(r\right)$ (which we term boost graphs), an arbitrary long link can be added to a vertex, which boosts the connectivity of that vertex. It will be connected to all other vertices with the same or less distance. The graphs in class $\mathsf{MDTG}\left(r\right)$ (which we term minimum radius DTGs) are a DTG but also with a minimum connectivity radius, where vertices are always connected.

Opposed to the usual assumption that $\mathsf{QUDG}\left(r\right)$ actually stands for a symmetric subgraph/supergraph of $\mathsf{MinDG}\left(r\right)\cap \mathsf{MaxDG}\left(1\right)$, we denote it here just as $\mathsf{MinDG}\left(r\right)\cap \mathsf{MaxDG}\left(1\right)$ to stay consistent with the notation used in the table. Class $\mathsf{QUDG}\left(r\right)$, as usually used in the literature, can be found under ${\mathsf{QUDG}}^{-}$ and the same class ${\mathsf{QUDG}}^{+}$ in the table.

The tables in Appendix A are tiled into $8\times 8$ blocks, referred to as $M({\gamma }_1,{\gamma }_2)$ in the following, each representing the relations of the classes $\mathsf{All}$, $\mathsf{MinDG}$, $\mathsf{MaxDG}$, $\mathsf{CRG}$, $\mathsf{QUDG}$, $\mathsf{BG}$, $\mathsf{DTG}$, and $\mathsf{MDTG}$ under the transformations ${\gamma }_1$ and ${\gamma }_2$, i.e., $M({\gamma }_1,{\gamma }_2)$, and represents the 64 relations given by

$$\begin{array}{cc}\hfill & \phantom{\times }\left({\gamma }_1\left(\mathsf{All}\right),{\gamma }_1\left(\mathsf{MinDG}\right),{\gamma }_1\left(\mathsf{MaxDG}\right),{\gamma }_1\left(\mathsf{CRG}\right),{\gamma }_1\left(\mathsf{QUDG}\right),{\gamma }_1\left(\mathsf{BG}\right),{\gamma }_1\left(\mathsf{DTG}\right),{\gamma }_1\left(\mathsf{MDTG}\right)\right)\hfill \\ \hfill & \times \left({\gamma }_2\left(\mathsf{All}\right),{\gamma }_2\left(\mathsf{MinDG}\right),{\gamma }_2\left(\mathsf{MaxDG}\right),{\gamma }_2\left(\mathsf{CRG}\right),{\gamma }_2\left(\mathsf{QUDG}\right),{\gamma }_2\left(\mathsf{BG}\right),{\gamma }_2\left(\mathsf{DTG}\right),{\gamma }_2\left(\mathsf{MDTG}\right)\right)\hfill \end{array}$$

All relations in the tables in Appendix A were automatically determined by applying FindInstance of Mathematica 12.1 on the derived expression (6) using the Euclidean metric.

In connection with the relations of the base classes shown in the Hasse diagram in Figure 4, the following observations can be made for the derived tables.

For each $M(\gamma ,\gamma )$ block (i.e. when applying the same transformation to the columns and rows of the block), the row for $\mathsf{All}$ is the row for $\mathsf{MDTG}$ but read reversed from right to left instead of left to right. The same applies for the row pairs $(\mathsf{MinDG},\mathsf{DTG})$, $(\mathsf{MaxDG}$, $\mathsf{BG})$ and $(\mathsf{CRG}$, $\mathsf{QUDG})$ (which are not directly connected in the Hasse diagram).

Moreover, the transformations ${(·)}^{-}$ and ${(·)}^{+}$ yield obviously the same graph class when applied on $\mathsf{All}$. The same applies to $\mathsf{QUDG}$, as already discussed. As well, applied on $\mathsf{MinDG}$ and as well on $\mathsf{MaxDG}$, transformations ${(·)}^{-}$ and ${(·)}^{+}$ yield the same classes, respectively.

These base classes ($\mathsf{All}$, $\mathsf{MaxDG}$, $\mathsf{MinDG}$ and $\mathsf{QUDG}$) are as well exactly those classes whose symmetric variants due to ${(·)}^{-}$ and ${(·)}^{+}$ are contained in the base class. For the other classes neither the subset relation nor superset relation is satisfied between base classes and their symmetric variants.

Both transformations ${(·)}^{-}$ and ${(·)}^{+}$ obviously preserve the subset relation order of the base classes. Moreover, neither ${(·)}^{-}$ nor ${(·)}^{+}$ yield two base classes collapsing into one single class.

The graph class relation for all classes between directed and symmetric, complementry-directed and symmetric, and as well, directed and complementry-directed is always orthogonal, i.e., the $8\times 8$ block $M({\gamma }_1,{\gamma }_2)$ consists only of entries ${\times }_n^m$ in this case.

Trivially, $M(\perp ,\perp )$ and $M(\neg \perp ,\neg \perp )$ consists only of entries =, since the first always yields the empty graph independent of the source graph, while for the latter, it is always the complete graph as well as being independent of the source graph.

Finally, putting all the tables together into one single table (with the same class ordering for rows and columns) yields a trivially symmetric matrix with diagonal entries =, however, with reversed relations ⊂ and ⊃ for all off-diagonal entries.

6. Conclusions

In this paper, we described how to prove or disprove containedness relations of specific axiomatic-described geometric graph classes on a meta-level. We proved the correctness of the general logical existentially quantified expressions over placeholders for inclusion, exclusion, and transitive transfer predicates. We illustrated the concept with concrete predicates in the context of simple theoretical wireless network models.

Though we focused on geometric classes in this work, by its generality, the concept is also applicable to any graph class, which can be described by means of inclusion, exclusion and transfer axioms and simple graph transformations.

The decidability of the problem of testing containedness for concrete inclusion, exclusion and transfer predicates depends on the concrete theories we consider. These are typically extensions of the theory of real numbers with norms, distances, cost functions or more general function symbols. In ongoing work, we are investigating the decidability of such theories.

Though a logical representation of graphs is not new in general, we believe with the axiomatic graph class representation and the discussed simple transformations described in this work, we discovered a promising graph theoretical novel concept for containedness verification, which can be generalized in many further directions.

Future work includes extending the theory beyond simple graph transformations. Moreover, one can drop the condition on transfer predicates to be transitive or even further that the edges involved do not have to be originated at the two vertices to which the transfer predicate is applied.