1

I tried many ways to solve this but failed.

Any tips or way to solve?

David G. Stork
  • 30,409
Donia M. Manasra
  • 11
  • 1
    We need to know more about the graph. Is it connected? Are edges allowed to connect a vertex to itself? – Charles Hudgins Sep 03 '19 at 21:10
  • 2
    Do you consider two graphs the same if they are isomorphic? If not (that is, we count "labeled graphs"), the answer is $${{n \choose 2} \choose m}.$$ – M. Winter Sep 03 '19 at 21:14
  • Think about it as if each edge represent picking $2$ vertices (like 2 balls from an urn of $n$ balls) and with replacement ofcourse because anothe edge maybe connected to the same vertex – Fareed Abi Farraj Sep 03 '19 at 21:46

0 Answers0