Common consequents in directed graphs

From MaRDI portal





If u and v are two distinct nodes of a directed graph \(G_ n\), let N(u,v) denote the least integer k (if it exists) such that there exists a node w whose distance from u and whose distance from v equals k. The author shows that if N(u,v) exists then N(u,v)\(\leq [(n^ 2+3)/2]-n\).











This page was built for publication: Common consequents in directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3695285)