1. Math
  2. Advanced Math
  3. let g be a simple graph an induced subgraph sg...

Question: let g be a simple graph an induced subgraph sg...

Question details

Let 𝐺G be a (simple) graph. An induced subgraph π‘†βŠ†πΊSβŠ†G is a subgraph such that for all π‘₯,π‘¦βˆˆπ‘‰(𝑆)x,y∈V(S) such that {π‘₯,𝑦}∈𝐸(𝐺){x,y}∈E(G), then {π‘₯,𝑦}∈𝐸(𝑆){x,y}∈E(S) (that is to say, it can be considered as subgraphs of 𝐺G obtained by deleting vertices). Let 𝐾𝑛Kndenote the complete graph on 𝑛n vertices.
How many induced subgraphs of 𝐾𝑛Kn are there (up to isomorphism):

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution