Degrees in a digraph whose nodes are graphs (Q1916093)

An \(f\)-graph is an unlabeled graph having no vertices of degree greater than \(f\). The authors define the digraph \(D(n, f)\) whose node set is the set of \(f\)-graphs of order \(n\) and such that there is an arc from the node corresponding to graph \(H\) to the node corresponding to the graph \(K\) if and only if \(K\) is obtainable from \(H\) by the addition of a single edge. Some results for \(f= 2\) are reviewed and the node degrees in \(D(n, n- 1)\) are investigated. Also some comments are given for questions for \(D(n, f)\) where \(2\leq f< n- 1\).