Abstract
A chordal ring, denoted by CR(N, d), is a graph G = (V, E) with V = {0,1,..., N − 1} and E = {(u, v) | [v − u]N = 1 or d}, where 2 ≤ < N ≤ N/2 and [r]N denotes r modulo N. We show that for 2 ≤ d ≤ N/2, CR(N, d) has 4 independent spanning trees rooted at the same vertex, and for 2 ≤ d = N/2, CR(N, d) has 3 independent spanning trees rooted at the same vertex. We can design a fault-tolerant broadcasting scheme for CR(N, d) using independent spanning trees.
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.
