Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
type: Item
instance of: scholarly article
title: Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
zbMATH Open document ID: 0996.68024
DOI: 10.1016/S0020-0255(01)00121-9
published in: Information Sciences
publication date: 2002-06-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1758137
zbMATH Keywords: fault-tolerance
zbMATH Keywords: security
author: Adele A. Rescigno
MaRDI profile type: Publication
cites work: A group-theoretic model for symmetric interconnection networks
cites work: On Group Graphs and Their Fault Tolerance
cites work: Fault tolerant routing in the star and pancake interconnection networks
cites work: Large k‐preserving sets in infinite graphs
cites work: Q4703869
cites work: Fault tolerance of the star graph interconnection network
cites work: Q5802176
cites work: On the fault-diameter of the star graph
cites work: Efficient dispersal of information for security, load balancing, and fault tolerance
cites work: How to share a secret
cites work: Topological properties of star graphs
description: scientific article; zbMATH DE number 1758137