Fisher's inequality for designs on regular graphs (Q5957823): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3737429 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial Properties of Group Divisible Incomplete Block Designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5627526 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4876974 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4002218 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4894999 / rank | |||
Normal rank |
Latest revision as of 23:44, 3 June 2024
scientific article; zbMATH DE number 1719138
Language | Label | Description | Also known as |
---|---|---|---|
English | Fisher's inequality for designs on regular graphs |
scientific article; zbMATH DE number 1719138 |
Statements
Fisher's inequality for designs on regular graphs (English)
0 references
11 December 2002
0 references
It is shown that for a \((v,k,\lambda, \mu)\)-design on a regular graph with adjacency matrix \(A\), \( r\geq v \) if \((r-\lambda)/(\mu-\lambda)\) is not a multiple eigenvalue of \(A\), where \(r\) is the replication number of the design.
0 references
Fischer's inequality
0 references
design on regular graphs
0 references