The connectivity of the block-intersection graphs of designs | Zendy

Donovan R. Hare | Zendy; William Mc Cuaig | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The connectivity of the block-intersection graphs of designs

Author(s) -

Donovan R. Hare,

William Mc Cuaig

Publication year - 1993

Publication title -

designs codes and cryptography

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.898

H-Index - 61

eISSN - 1573-7586

pISSN - 0925-1022

DOI - 10.1007/bf01389350

Subject(s) - intersection (aeronautics) , block (permutation group theory) , combinatorics , mathematics , computer science , geography , cartography

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research