Random word

How do you use Subgraph in a sentence? See 10+ example sentences showing how this word appears in different contexts, plus the exact meaning.

Rare word

Subgraph in a sentence

Related words

Subgraph | Subgraphs

Subgraph meaning

A graph or network that makes up part of a larger graph or network.

Using Subgraph

  • The main meaning on this page is: A graph or network that makes up part of a larger graph or network.
  • In the example corpus, subgraph often appears in combinations such as: subgraph is, the subgraph, kuratowski subgraph.

Context around Subgraph

  • Average sentence length in these examples: 26.1 words
  • Position in the sentence: 2 start, 6 middle, 6 end
  • Sentence types: 14 statements, 0 questions, 0 exclamations

Often before:

kuratowski 4× given 1× complete 1× induced 1× forbidden 1×

Often after:

containing 1× citation 1× cannot 1×

Sentence patterns with Subgraph

These short patterns come directly from the example sentences and show how the word is often embedded:

a kuratowski subgraph 2× a given subgraph is or 1× a kuratowski subgraph cannot be 1× a kuratowski subgraph citation 1× as its subgraph 1× be the subgraph of produced 1× block that subgraph is unreachable 1× edgeless induced subgraph or independent 1×

Sentence openings and endings

Common sentence openings:

for example finding 2× a subtree of 1× an example of 1× at every iteration 1× if a subgraph 1× spanning tree let 1×

Common sentence endings:

a kuratowski subgraph 2× problem np complete 2× as its subgraph 1× be safely removed 1× been discovered citation 1× by the algorithm 1×

Words around Subgraph

Just before it in the word index:

subgrades 2 subgrade 2 subgoal 3 subglacial 10 subgiant 8 subgenus 23

Just after it in the word index:

subgraphs 5 subgroup 167 subgrouped 2 subgrouping 6 subgroups 120 subh 2

Similar in corpus frequency:

aaronson 18 abai 18 abass 18 abatements 18 abdulfatah 18 abebe 18

Corpus analysis for Subgraph

  • In this selection, "subgraph" usually appears in the middle of the sentence. The average example has 26.1 words, and this corpus slice is mostly made up of statements.
  • Around the word, kuratowski, given, complete, containing, citation and cannot stand out and add context to how "subgraph" is used.
  • Recognizable usage signals include a kuratowski subgraph and a given subgraph is or. That gives this page its own corpus information beyond isolated example sentences.
  • By corpus frequency, "subgraph" sits close to words such as aaronson, abai and abass, which helps place it inside the broader word index.

Example types with subgraph

The same corpus examples are grouped by length and sentence type, making it easier to see the contexts in which the word appears:

Short example sentences

Therefore, a graph that contains a Kuratowski subgraph cannot be planar. (11 words)

For example: * Finding the largest complete subgraph is called the clique problem (NP-complete). (14 words)

However, it has a subgraph that is homeomorphic to K 3,3 and is therefore not planar. (17 words)

Longer example sentences

A subtree of a tree T is a tree consisting of a node in T and all of its descendants in T.This is different from the formal definition of subtree used in graph theory, which is a subgraph that forms a tree – it need not include all descendants. (49 words)

The special case of cubic planar graphs (for which the only minimal forbidden subgraph is K 3,3 ) was also independently proved by Karl Menger in 1930. citation Since then, several new proofs of the theorem have been discovered. citation. (40 words)

The A* algorithm is a generalization of Dijkstra's algorithm that cuts down on the size of the subgraph that must be explored, if additional information is available that provides a lower bound on the "distance" to the target. (39 words)

Example sentences (14)

If a subgraph is not connected from the subgraph containing the entry block, that subgraph is unreachable during any execution, and so is unreachable code ; under normal conditions it can be safely removed.

At every iteration of Prim's algorithm, an edge must be found that connects a vertex in a subgraph to a vertex outside the subgraph.

This allows the correctness of a planarity testing algorithm to be verified for nonplanar inputs, as it is straightforward to test whether a given subgraph is or is not a Kuratowski subgraph. citation.

An example of a graph which doesn't have K 5 or K 3,3 as its subgraph.

A subtree of a tree T is a tree consisting of a node in T and all of its descendants in T.This is different from the formal definition of subtree used in graph theory, which is a subgraph that forms a tree – it need not include all descendants.

For example: * Finding the largest complete subgraph is called the clique problem (NP-complete).

For example: * Finding the largest edgeless induced subgraph or independent set is called the independent set problem (NP-complete).

However, it has a subgraph that is homeomorphic to K 3,3 and is therefore not planar.

Advertentie

Spanning tree Let be a connected, weighted graph and let be the subgraph of produced by the algorithm.

The A* algorithm is a generalization of Dijkstra's algorithm that cuts down on the size of the subgraph that must be explored, if additional information is available that provides a lower bound on the "distance" to the target.

The more difficult direction in proving Kuratowski's theorem is to show that, if a graph is nonplanar, it must contain a Kuratowski subgraph.

Therefore, a graph that contains a Kuratowski subgraph cannot be planar.

The special case of cubic planar graphs (for which the only minimal forbidden subgraph is K 3,3 ) was also independently proved by Karl Menger in 1930. citation Since then, several new proofs of the theorem have been discovered. citation.

With this notation, Kuratowski's theorem can be expressed succinctly: a graph is planar if and only if it does not have a Kuratowski subgraph.

Advertentie

Common combinations with subgraph

These word pairs occur most frequently in English texts:

Frequently asked questions

How do you use "subgraph" in a sentence?
An example: "If a subgraph is not connected from the subgraph containing the entry block, that subgraph is unreachable during any execution, and so is unreachable code ; under normal conditions it can be safely removed." This page contains 10+ example sentences with the word "subgraph" from authentic English texts.
What does "subgraph" mean?
Subgraph means: A graph or network that makes up part of a larger graph or network.
How many example sentences with "subgraph" are there?
Voorbeeldzinnen.info contains at least 10+ example sentences with "subgraph", drawn from a database of millions of English sentences.