The connectivity of the block-intersection graphs of designs (Q1209216): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Donovan R. Hare / rank
Normal rank
 
Property / author
 
Property / author: William D. McCuaig / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Peter Horák / rank
Normal rank
 
Property / author
 
Property / author: Donovan R. Hare / rank
 
Normal rank
Property / author
 
Property / author: William D. McCuaig / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Peter Horák / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in the block-intersection graph of pairwise balanced designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137967 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 16:33, 17 May 2024

scientific article
Language Label Description Also known as
English
The connectivity of the block-intersection graphs of designs
scientific article

    Statements

    The connectivity of the block-intersection graphs of designs (English)
    0 references
    0 references
    16 May 1993
    0 references
    In the paper it is shown that the vertex connectivity of the block- intersection graph of a BIBD equals its minimum degree.
    0 references
    0 references
    block designs
    0 references
    connectivity
    0 references
    block-intersection graph
    0 references
    BIBD
    0 references
    0 references
    0 references
    0 references