Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs) (Q1027703)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5571573
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs) |
scientific article; zbMATH DE number 5571573 |
Statements
Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs) (English)
0 references
30 June 2009
0 references
bipartite graphs
0 references
unique path
0 references
uniform minimal graphs
0 references
communication network
0 references
symmetrical block design
0 references
0.7254955768585205
0 references
0.7249091267585754
0 references
