What is the relation that connects the nodes of this digraph?
$\begingroup$
$\endgroup$
4
-
$\begingroup$ I think there is a typo in the question. It shouldn't be "diagraph" right? $\endgroup$– H_DCommented Apr 29, 2020 at 2:05
-
$\begingroup$ Thanks for checking up on my spelling. "Digraph" is actually what I intended. It is an abbreviation of "directed graph". $\endgroup$– GalenCommented Apr 29, 2020 at 2:07
-
$\begingroup$ Oh okok sorry I didn't know that abbreviation. $\endgroup$– H_DCommented Apr 29, 2020 at 2:09
-
$\begingroup$ No problem at all. Every discipline has its own jargon that confuses everyone else :P $\endgroup$– GalenCommented Apr 29, 2020 at 2:10
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
2
Node $i$ goes to node $i+s(i)$, where $s(i)$ is the sum of the proper divisors of $i$
