in Graph Theory edited by
322 views
0 votes
0 votes

How many non-isomorphic directed graphs are there with $n$ vertices when $n$ is

  1. $2$
  2. $3$
  3. $4$
in Graph Theory edited by
by
322 views

Please log in or register to answer this question.

Related questions

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