Abstract
Let G=( V, E) be a digraph with diameter D≠1. For a given integer 1⩽ t⩽ D, the t- distance connectivity of G is the minimum cardinality of an x→ y separating set over all the pairs of vertices x, y which are at distance d( x, y)⩾ t. The t- distance edge-connectivity of G is defined analogously. This paper studies some results on the distance connectivities of digraphs and bipartite digraphs. These results are given in terms of the parameter l, which can be thought of as a generalization of the girth of a graph. For instance, it is proved that G is maximally connected iff either D⩽2l−1 or k(2l)⩾δ . As a corollary, similar results for (undirected) graphs are derived.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
