Connectivity of the block-intersection graphs of designs

Simple item page
dc.contributor.authorHare, Donovan R.
dc.contributor.authorMcCuaig, William
dc.date.accessioned2010-05-17T15:51:24Z
dc.date.available2010-05-17T15:51:24Z
dc.date.copyright1991en
dc.date.issued2010-05-17T15:51:24Z
dc.description.abstractIt 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.en
dc.identifier.urihttp://hdl.handle.net/1828/2767
dc.language.isoenen
dc.relation.ispartofseriesDMS-588-IRen
dc.subjecttechnical reports (mathematics and statistics)
dc.subject.departmentDepartment of Mathematics and Statistics
dc.titleConnectivity of the block-intersection graphs of designsen
dc.typeTechnical Reporten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
DMS-588-IR.pdf
Size:
189.95 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.84 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Faculty and Staff Publications
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.