The connectivity of the block-intersection graphs of designs

DOI10.1007/BF01389350MaRDI QIDQ1209216zbMATH OpenOpenAlexFDO

Authors Donovan R. Hare, William McCuaig

Publication date 16 May 1993

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01389350, http://hdl.handle.net/1828/2767

zbMATH Keywords

BIBDblock designsblock-intersection graphconnectivity

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Connectivity (05C40)

Review text

In the paper it is shown that the vertex connectivity of the block- intersection graph of a BIBD equals its minimum degree.

Cites work

• Cycles in the block-intersection graph of pairwise balanced designs
• scientific article; zbMATH DE number 431053 (Why is no real title available?)
• scientific article; zbMATH DE number 3869243 (Why is no real title available?)

Cited in

(8)

• On the connectedness of saturated square designs
• Domination number of incidence graphs of block designs
• Existential closure of block intersection graphs of infinite designs having finite block size and index
• Silver block intersection graphs of Steiner 2-designs
• scientific article; zbMATH DE number 25254 (Why is no real title available?)
• On the connectedness of partially balanced block designs
• Strongly linear trend-free block designs and 1-factors of representative graphs
• More on block intersection polynomials and new applications to graphs and block designs

This page was built for publication: The connectivity of the block-intersection graphs of designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209216)