# subgraph

Also found in: Encyclopedia, Wikipedia.

## subgraph

(ˈsʌbˌɡrɑːf; ˈsʌbˌɡræf)
n
(Mathematics) a graph linked with another graph
Collins English Dictionary – Complete and Unabridged, 12th Edition 2014 © HarperCollins Publishers 1991, 1994, 1998, 2000, 2003, 2006, 2007, 2009, 2011, 2014
References in periodicals archive ?
Finding the densest subgraph is an important graph-mining task with many applications .
We consider conditions for [[pi].sub.1] and [[pi].sub.2] which guarantee that there exists a simple graph [G.sub.2] realizing [[pi].sub.2] such that [G.sub.2] is the subgraph of any simple graph [G.sub.1] that realizes [[pi].sub.1].
A partial single-valued co-neutrosophic subgraph of single-valued co-neutrosophic graph G = (A, B) is a single-valued co-neutrosophic graph H = (V', E') such that
The latter are defined as a connected and acyclic subgraph of G having all vertices (nodes) of G and some or all its edges.
A graph H is said to be a subgraph of a graph G if V(H) [subset or equal to] V(G) and E(H) [subset or equal to] E(G).
(2) If node i has a neighbor node j (j = 1,2, 3, ..., N; j [not equal to] i), then we set i and j together to form a new complete subgraph [G.sub.1] which has two nodes.
The subgame G(z) of the game G([z.sub.0]) is played in the subgraph K(z) = ([Z.sup.z], F), where [Z.sup.z] is the set of vertices of the subgraph K(z).
In addition, we propose [lambda]-VF2 algorithm to match the subgraph isomorphism.
Morgan fingerprints sometimes simply encode the presence/absence of different subgraphs and sometimes actually count the number of times each subgraph occurs in a chemical.
A community can be defined as a subgraph of a network having higher number of similar nodes tightly connected with each other than with the nodes outside the subgraph.
A graph G' = (X', E') is said to be a subgraph of G = (X, E) if X' [subset or equal to] X and E' [subset or equal to] E.
A parallel closure of a graph is an induced subgraph on two vertices.
Site: Follow: Share:
Open / Close