inducedSubgraph -- A method for finding the induced subgraph of any Graph or Digraph

Synopsis

• Usage:

  H = inducedSubgraph(G, L)

  D' = inducedSubgraph(D, L)

• Inputs:
  • G, an instance of the type Graph,
  • D, an instance of the type Digraph,
  • L, a list, This list should contain vertices of G
• Outputs:
  • H, an instance of the type Graph,
  • D', an instance of the type Digraph, The subgraph induced by removing the vertices in L

Description

i1 : G = completeGraph 5

o1 = Graph{0 => {1, 2, 3, 4}}
           1 => {0, 2, 3, 4}
           2 => {0, 1, 3, 4}
           3 => {0, 1, 2, 4}
           4 => {0, 1, 2, 3}

o1 : Graph

i2 : S = {3,4}

o2 = {3, 4}

o2 : List

i3 : inducedSubgraph(G,S)

o3 = Graph{3 => {4}}
           4 => {3}

o3 : Graph

i4 : D = digraph ({{1,2},{2,3},{3,4},{4,1},{2,4}},EntryMode=>"edges");

i5 : D' = inducedSubgraph(D,{1,2,4})

o5 = Digraph{1 => {2}}
             2 => {4}
             4 => {1}

o5 : Digraph

See also

• deleteVertex -- a method for deleting the vertex of a graph