Abstract
The scrambling index k(D) of a primitive digraph D is the smallest positive integer k such that for every pair of vertices x and y, there exists a vertex v such that there exist directed walks of length k from x to v and from y to v. In this paper, we study the scrambling index set of primitive digraphs.
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.
