Abstract:We study the (∆, D) and (∆, N ) problems for double-step digraphs considering the unilateral distance, which is the minimum between the distance in the digraph and the distance in its converse digraph, the latter obtained by changing the directions of all the arcs.The first problem consists of maximizing the number of vertices N of a digraph, given the maximum degree ∆ and the unilateral diameter D * , whereas the second one (somehow dual of the first) consists of minimizing the unilateral diameter given the m… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.