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 four independent spanning trees rooted at the same vertex.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters 1999-02, Vol.69 (3), p.155-160
Hauptverfasser:	Iwasaki, Yukihiro, Kajiwara, Yuka, Obokata, Koji, Igarashi, Yoshihide
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Broadcasts Channel graphs Chordal rings Computer science Computer science control theory systems Exact sciences and technology Fault tolerance Graphs Independent spanning trees Information processing Information retrieval. Graph Studies Theoretical computing Theory
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 four independent spanning trees rooted at the same vertex.
ISSN:	0020-0190 1872-6119
DOI:	10.1016/S0020-0190(98)00205-1