A graph composed of a subset of the parent graph's nodes and edges.

(n.)given a graph, a subgraph is another graph whose vertices and edges are in the original graph.

Distinguishable part of a graph. See Also Graph.

A subgraph of a graph is some smaller portion of that graph. Here is an example of a subgraph: A graph A subgraph An induced (generated) subgraph is a subset of the vertices of the graph together with all the edges of the graph between the vertices of this subset. The induced subgraph of the above example is

A subgraph is of a graph is itself a graph in which all of the edges and vertices are contained within the original graph.[refcomap, p.212] Definitions: T

a compound or container node

a graph that has a subset of vertices and a subset of edges with respect to some base graph

an individual line within the entire study graph

a subset of the nodes and edges within a graph

a subset of the vertices with their internal links

if every edge of graph A is also an edge of graph B, then graph A is a subgraph of graph B

A connected subset of a graph. Typically, a subgraph is a connected subset of nodes and links from a larger graph. Graphs are a common representation in sensemaking where the nodes are frames and the links represent binary relations of some kind.