Generalized activities and \(K\)-terminal reliability. II
type: Item
instance of: scholarly article
title: Generalized activities and \(K\)-terminal reliability. II
zbMATH Open document ID: 0816.05053
DOI: 10.1016/0012-365X(93)E0094-K
published in: Discrete Mathematics
publication date: 1995-02-01T00:00:00Z
review text: [For Part I see ibid. 96, No. 2, 131-149 (1991; Zbl 0752.05054).] Tutte's description of the (di)chromatic polynomial of a graph in terms of activities with respect to maximal forests gives rise to a partition of the power set of the edge set as a collection of intervals, one corresponding to each maximal forest. This partition is useful in producing simplified expressions of all-terminal reliability. This paper compares two similar partitions connected with \(K\)-terminal reliability, one due to the author and the other due to Colbourn and Pulleyblank.
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 716473
zbMATH Keywords: chromatic polynomial
zbMATH Keywords: activities
zbMATH Keywords: partition
zbMATH Keywords: maximal forest
zbMATH Keywords: \(K\)-terminal reliability
author: L. Traldi
MaRDI profile type: Publication
cites work: Matroids and a Reliability Analysis Problem
cites work: Matroid Steiner problems, the Tutte polynomial and network reliability
cites work: The Tutte polynomial
cites work: Generalized activities and the Tutte polynomial
cites work: Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
cites work: Generalized activities and \(K\)-terminal reliability
cites work: Q3216652
full work available at URL: 0012-365x(93)e0094-k
OpenAlex ID: W4210385927
description: scientific article; zbMATH DE number 716473