Connectivity of the block-intersection graphs of designs
Date
2010-05-17T15:51:24Z
Authors
Hare, Donovan R.
McCuaig, William
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
It is shown that the vertex connectivity of the block-intersection graph of a balanced incomplete block design, BIBD(v,k,1), is equal to its minimum degree. A similar statement is proved for the edge connectivity of the block-intersection graph of a pairwise balanced design, PBD(v,k,1). A partial result on the vertex connectivity of these graphs is also given. Minimal vertex and edge cuts for the corresponding graphs are characterized.
Description
Keywords
technical reports (mathematics and statistics)