recategorized by
1,075 views
1 votes
1 votes

consider a complete bipartite graph K(3,3)

The ratio of total number of possible vertex induced subgraphs to the total number of possible edge induced subgraph in given bipartite graph is x:y .

then value of x+y is______.

recategorized by

1 Answer

Best answer
1 votes
1 votes

SUB-GRAPH  : A sub-graph of G is a graph H such that V(H)  $\subseteq$ V(G) and E(H)  $\subseteq$ E(G)

In general , Normal Sub-graph is obtain by either you delete vertices or you delete Edges or both of them.

Induced sub-graph :  is obtained  by deleting a set of vertices only

Now , As we know that It's K(3,3) complete bi-partite graph

Total number of vertices = 6 

So , In each and every  vertices out 6 vertices we have a 2 choice 1) Either we deleted a vertex  2) Not deleted a vertex

therefore , total number of possible vertex induced sub-graphs = 26

Now , edge induced sub-graph  is obtained  by deleting a set of edges only

Total number of Edges in complete Bi-partite graph = 3 x 3 = 9

So , In each and every  edges out 9 edges we have a 2 choice 1) Either we deleted a edges   2) Not deleted a edges

therefore, total number of possible edge induced sub-graphs = 29

now , they asked , 

X : Y = 26 : 29 = 1:23

therefore , X+Y = 1 + 23 = 9 ans

 

 

 

selected by
Answer:

Related questions

0 votes
0 votes
0 answers
1
Sahil_Lather asked Jan 27, 2023
514 views
Let Gn be the complete bipartite graph K13, 17 then the chromatic number of G̅n is _____ (G̅n is complement of Gn and n = 30)A13B17Cn(n−1)2−13×17Dn(n−1)2−2
0 votes
0 votes
2 answers
3
Tesla! asked Apr 2, 2017
812 views
let G=(V,E) be an connected graph, let $\left | V \right |= n$Find largest value of n such thati) G is complete &ii) G is bipartitewith valid proof