Abstract
Given a strongly connected digraph D and a connected subdigraph T of D, the T-structure connectivity of D is the cardinality of a minimum set of subdigraphs in D, whose removal results in a non-strongly connected digraph and . The T-substructure connectivity of D is the cardinality of a minimum set of subdigraphs in D, whose removal results in a non-strongly connected digraph and each element is isomorphic to a connected subdigraph of T. In this work, we study resp. for , and ; resp. for and ; and resp. for , , and , where is the directed k-ary n-cube, is the in-star on t + 1 vertices, and are, respectively, the directed path and cycle of length t.
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 callMore From: International Journal of Parallel, Emergent and Distributed Systems
Disclaimer: 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.
