Previous |  Up |  Next

Article

Title: A graphical way to solve the Boolean matrix equations $AX=B$ and $XA=B$ (English)
Author: Nieminen, U. J.
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 10
Issue: 1
Year: 1974
Pages: (61)-65
.
Category: math
.
MSC: 05B99
MSC: 05Cxx
MSC: 15A24
MSC: 94A20
idZBL: Zbl 0273.15013
idMR: MR0351648
.
Date available: 2009-09-24T16:37:43Z
Last updated: 2012-06-04
Stable URL: http://hdl.handle.net/10338.dmlcz/125747
.
Reference: [1] S. T. Hedetniemi: Graphs of $(0, 1)$-matrices.In: Recent Trends in Graph Theory (ed. by M. Capobianco, J. B. Frechen, and M. Krolik). Springer-Verlag, Berlin-Heidelberg- New York 1971, 157-171. Zbl 0217.31206, MR 0280400
Reference: [2] R. S. Ledley: Digital computer and control engineering.McGraw-Hill, New York-Toronto-London 1960.
Reference: [3] R. S. Ledley: Programming and utilizing digital computers.McGraw-Hill, New York-Toronto-London 1962. Zbl 0121.34803
Reference: [4] S. Rudeanu: On Boolean matrix equations.Rev. Roum. Math. Pures et Appl. XVII (1972), 7, 1075-1090. Zbl 0259.06011, MR 0320029
.

Files

Files Size Format View
Kybernetika_10-1974-1_5.pdf 460.6Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo