Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs) (Q1027703): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Embedding a ring in a hypercube with both faulty links and faulty nodes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Classification of the Hamiltonian cycles in binary hypercubes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Arrangement graphs: A class of generalized star graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shaped lattice graphs as models of the multiprocessor computer systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational Science and Its Applications – ICCSA 2004 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4434707 / rank | |||
Normal rank | |||
Revision as of 16:57, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs) |
scientific article |
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
