Independent spanning trees of chordal rings

Independent spanning trees of chordal rings

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,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Iwasaki, Yukihiro, Kajiwara, Yuka, Obokata, Koji, Igarashi, Yoshihide
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Applied sciences
Biconnected Graph
Broadcasting Scheme
Computer science
control theory
systems
Exact sciences and technology
Information retrieval. Graph
Internal Vertex
Source Vertex
Span Tree
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/BFb0045110