Noun
subgraph (plural subgraphs)
(graph theory) A graph or network that makes up part of a larger graph or network.
After shipping Fieldrunners, we discovered that disconnecting a node or subgraph alone will not pause the playback of the AudioBufferSourceNodes. Source: Internet
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. Source: Internet
An example of a graph which doesn't have K 5 or K 3,3 as its subgraph. Source: Internet
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. Source: Internet
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. Source: Internet
For example: * Finding the largest complete subgraph is called the clique problem (NP-complete). Source: Internet