Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)

DOI10.1134/S000511790902012XMaRDI QIDQ1027703zbMATH OpenOpenAlexFDO

Authors M. F. Karavai, P. P. Parkhomenko, 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

zbMATH Keywords

bipartite graphscommunication networksymmetrical block designuniform minimal graphsunique path

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial optimization (90C27) Applications of design theory to circuits and networks (94C30)

Recommendations

• scientific article; zbMATH DE number 4043091
• On tactical configurations, regular bipartite graphs, and (v, k, even)-designs
• Constructions for a certain type of balanced bipartite block designs
• scientific article; zbMATH DE number 140108
• scientific article; zbMATH DE number 812056

Cites work

• Arrangement graphs: A class of generalized star graphs
• Classification of the Hamiltonian cycles in binary hypercubes
• Computational Science and Its Applications – ICCSA 2004
• Embedding a ring in a hypercube with both faulty links and faulty nodes
• scientific article; zbMATH DE number 2009833 (Why is no real title available?)
• Shaped lattice graphs as models of the multiprocessor computer systems

Cited in

(13)

• Generalized Clos networks
• Organization of self-diagnosis of the discrete multicomponent systems a structure like bipartite quasicomplete graphs
• Fragment method of restoring the operation of digital systems with the structure of a minimal quasicomplete graph with two paths between two users
• On the synthesis of systems possessing the structure of some combinatorial designs
• Conditions for the parameters of the block graph of quasi-symmetric designs
• On the route-oriented method of system diagnostics in digital systems structured as a symmetric 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
• An approach to multiagent organization of system diagnosis of digital systems structured as symmetrical bipartite graph
• Algorithmizing design of a class of combinatorial block diagrams
• scientific article; zbMATH DE number 1532276 (Why is no real title available?)
• Multiple combinatorial block diagrams
• An invariant extension method for system area networks of multicore computational systems. An ideal system network

This page was built for publication: Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027703)