Counting the minimum number of arcs in an oriented graph having weak diameter 2

Sandip Das, Koushik Kumar Dey, Pavan P D +1

An oriented graph has weak diameter at most $d$ if every non-adjacent pair of vertices are connected by a directed $d$-path. The function $f_d(n)$ denotes the minimum number of arc…