Abstract
The scrambling index of a primitive graph G is the smallest positive integer k such that for each pair of vertices u and v there is a vertex w such that there exists a uw-walk and a vw-walk of length k. We discuss the scrambling index of primitive graphs G consisting of two disjoint odd cycles each of length s connected by some paths of length ℓ0. For such primitive graphs G we present formulae for scrambling indices that depend on s and ℓ0.
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 callMore From: IOP Conference Series: Materials Science and Engineering
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.
