connected subgraph

connected subgraph

(mathematics)
A connected graph consisting of a subset of the nodes and edges of some other graph.
References in periodicals archive ?
More formally, a graph is a knight subgraph if it is an isomorphism of some connected subgraph of the infinite knight's graph.
c]) which represents the maximal connected subgraph of G having all nodes of degree greater than one.
Hence, we performed our tests on connected subgraphs of [G.
A tree in G is a connected subgraph T = (V', E') containing no cycles.
A dominating set is connected if it induces a connected subgraph.
A cycle C in a graph is a connected subgraph in which the degree of every vertex in C is two.
A spanning tree of a connected subgraph induced by S [union] T in G is called a Steiner tree.
A prominent feature of Fedwire is that 25 nodes form a densely connected subgraph to which all the remaining nodes connect.
3 A subset of simple roots K [subset or equal to] [DELTA] is called connected if the induced Dynkin diagram of K is a connected subgraph of the Dynkin diagram of [DELTA].
A soliton graph G is elementary if its allowed edges form a connected subgraph covering all the external vertices.
Then the collection of monochromatic edges forms a connected subgraph of G.
We decompose T into a set of k connected subgraphs [V.

Full browser ?