Abstract
A normally regular digraph with parameters (n,k,λ,μ) is a k-regular digraph on n vertices in which any two non-adjacent vertices have μ common out-neighbours, any two vertices connected by an arc in one direction have λ common out-neighbours and any two vertices connected by arcs in both directions have 2λ−μ common out-neighbours. A Deza digraph with parameters (n,k,b,c) is a k-regular digraph on n vertices such that any two distinct vertices have b or c common out-neighbours. In this paper, we determine the arc-connectivities and minimum arc-cuts of normally regular digraphs and Deza digraphs.
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.
