Assertion: graph's g | /r/HasProperty | \displaystyle ig
Facets:
Source sentences:
text: Now, if some graph H {\displaystyle H} contains an I G {\displaystyle IG} as a subgraph, then H {\displaystyle H} is said to have G {\displaystyle G} as a minor, which is denoted as G ⪯ H {\displaystyle G\preceq H} .
text: Given a graph G {\displaystyle G} , and another graph G ′ {\displaystyle G'} , G ′ {\displaystyle G'} is called an I G {\displaystyle IG} if G ′ {\displaystyle G'} is formed from G {\displaystyle G} by replacing the vertices of G {\displaystyle G} with connected graphs such that if a vertex v {\displaystyle v} is replaced by a connected graph G v {\displaystyle G_{v}} , there are edges connecting G v {\displaystyle G_{v}} to each of the graphs replacing the vertices that are adjacent to v {\displaystyle v} in G {\displaystyle G} , and only to those graphs.
text: This yields an I G {\displaystyle IG} that is a subgraph of H {\displaystyle H} , and therefore, G ⪯ H {\displaystyle G\preceq H} .