The connectivity of the block-intersection graphs of designs
type: Item
instance of: scholarly article
title: The connectivity of the block-intersection graphs of designs
zbMATH Open document ID: 0778.05053
DOI: 10.1007/BF01389350
published in: Designs, Codes and Cryptography
publication date: 1993-05-16T00:00:00Z
review text: In the paper it is shown that the vertex connectivity of the block- intersection graph of a BIBD equals its minimum degree.
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05B05
zbMATH DE Number: 167545
zbMATH Keywords: block designs
zbMATH Keywords: connectivity
zbMATH Keywords: block-intersection graph
zbMATH Keywords: BIBD
author: Donovan R. Hare
author: William McCuaig
reviewed by: Peter Horák
MaRDI profile type: Publication
cites work: Q3337399
cites work: Cycles in the block-intersection graph of pairwise balanced designs
cites work: Q3137967
full work available at URL: https://doi.org/10.1007/bf01389350
OpenAlex ID: W1977035347
description: scientific article; zbMATH DE number 167545