On the relationship between the diameter and the size of a boundary of a directed graph (Q1329425): Difference between revisions

The authors establish a lower bound for the cardinality of a boundary \(B_ D(A)\) in a digraph \(D\) (\(A\) is a set of nodes of \(D\)) whose in- degree and out-degree are both at most \(\beta\geq 2\). This estimation yields several interesting corollaries.