Super-connected n-th iterated line digraphs

Super-connected n-th iterated line digraphs

0.00 Avg rating0 Votes
Article ID: iaor20062259
Country: China
Volume: 9
Issue: 2
Start Page Number: 35
End Page Number: 39
Publication Date: Jun 2005
Journal: OR Transactions
Authors: , ,
Abstract:

In this paper, we show that under the condition that the minimum degree is at least 3, the iterated line digraph of a super-arc-connected digraph is super-connected. As a consequence, the super-connectedness and super-arc-connectedness of the well known Kautz networks and the de Bruijn networks are obtained.

Reviews

Required fields are marked *. Your email address will not be published.