Abstract
AbstractIt is shown that every k‐connected locally semicomplete digraph D with minimum outdegree at least 2k and minimum indegree at least 2k − 2 has at least m = max{2, k} vertices x1, x2, ⃛, xm such that D − xi is k‐connected for i = 1, 2, ⃛, m.
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.
