in Graph Theory edited by
789 views
0 votes
0 votes

The Number of Labelled possible graph given below ?

 

what I did was →

we doesn’t  remove any of the edge out of 4   = $\binom{4}{0}$   [Because a Graph is sub-graph of itself]

we can remove any of one edge out of 4 = $\binom{4}{1}$

we can remove any of the two edges out of 4  = $\binom{4}{2}$

similarly ,  $\binom{4}{3}$ , $\binom{4}{4 }$

then  , add of the them

 

in Graph Theory edited by
by
789 views

4 Comments

[Because a Graph is sub-graph of itself]

A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G.

if u are playing with edges then u can also play with vertices. like graph can contain only 1 vertex. ( 4 cases)

or may be combination of vertices and edges like 2 vertex 1 edge etc.

1
1

thanks @Satbir

0
0
What's the final solution then?
0
0
We can also look at this question as finding number of possible subsets of a set.

Let S be a set with all the 4 edges, number of subgraphs possible is the number of subsets of S, so answer should be 16.
0
0

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true