induced subgraph

induced subgraph

[in‚düst ′səb‚graf]
(mathematics)
vertex-induced subgraph
References in periodicals archive ?
Acharya, Germina, and Ajitha [1] have shown that every graph can be embedded as an induced subgraph of a strongly multiplicative graph.
A graph is called claw-free if it has no induced subgraph isomorphic to [K.
A dominating set D of a graph G is said to be split and non-split dominating set if the induced subgraph <V\D> disconnected and <V\D> connected respectively.
If the induced subgraph of is connected, then is a connected dominating set (CDS).
An intersection graph of a set of 2 x 2 dense blocks is an induced subgraph of the so called X-grid which consists of the usual 2 dimensional grid, and diagonals for each grid square.
M,N] is defined as the induced subgraph of the square grid induced by the vertex set [T.
Note that every induced subgraph of G is also a comparability graph and moreover, every transitive orientation of G induces a transitive orientation on the edges of every induced graph of G.
By a (k + 1)-component of G we mean either the connected component of the restriction, or the induced subgraph of G on vertices corresponding to such connected component.
denote the quiver on 2N vertices that (i) contains Q as an induced subgraph on the vertices {1,2, .
As an induced subgraph of G(c; n) is of the form G(c; m) for some m, we deduce that S(z, w; u) = [e.
T] denotes the induced subgraph on vertex set T, and [bar.
For any SEO v on an SE graph G, the restriction of v to an induced subgraph of G gives an SEO on that subgraph.