Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)
From MaRDI portal
Publication:1027703
DOI10.1134/S000511790902012XzbMath1163.05311OpenAlexW2150114457MaRDI QIDQ1027703
P. P. Parkhomenko, M. F. Karavai, V. S. Podlazov
Publication date: 30 June 2009
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s000511790902012x
Combinatorial aspects of block designs (05B05) Combinatorial optimization (90C27) Applications of design theory to circuits and networks (94C30)
Related Items (11)
Algorithmizing design of a class of combinatorial block diagrams ⋮ Fragment method of restoring the operation of digital systems with the structure of a minimal quasicomplete graph with two paths between two users ⋮ An approach to multiagent organization of system diagnosis of digital systems structured as symmetrical bipartite graph ⋮ Diagnosis of single faulty components of digital systems structured as minimal quasicomplete \(7\times7\) graph with two paths between two users ⋮ An extended multiring of diameter 2 ⋮ Multiple combinatorial block diagrams ⋮ On the synthesis of systems possessing the structure of some combinatorial designs ⋮ An invariant extension method for system area networks of multicore computational systems. An ideal system network ⋮ On the route-oriented method of system diagnostics in digital systems structured as a symmetric bipartite graph ⋮ Generalized Clos networks ⋮ Organization of self-diagnosis of the discrete multicomponent systems a structure like bipartite quasicomplete graphs
Cites Work
- Unnamed Item
- Embedding a ring in a hypercube with both faulty links and faulty nodes
- Arrangement graphs: A class of generalized star graphs
- Classification of the Hamiltonian cycles in binary hypercubes
- Shaped lattice graphs as models of the multiprocessor computer systems
- Computational Science and Its Applications – ICCSA 2004
This page was built for publication: Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)
