scientific article; zbMATH DE number 4168716

MaRDI QIDQ3495384zbMATH OpenFDO

Authors Pinar Dundar

Publication date 1989

zbMATH Keywords

adjacency matrixBoolean functionBoolean graphcircuitcontact network graphminimum number of contactsprimitive connection matrixvertex transition matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• The minimization of Boolean function using Hamiltonian cycles
• scientific article; zbMATH DE number 701114
• On the realisation of Boolean functions by informational graphs
• Coverings of Boolean graphs
• scientific article; zbMATH DE number 30977

Cited in

(7)

• On the bit graph of Boolean vectors
• Properties of the interval graph of a Boolean function
• The minimization of Boolean function using Hamiltonian cycles
• scientific article; zbMATH DE number 3904625 (Why is no real title available?)
• scientific article; zbMATH DE number 4093372 (Why is no real title available?)
• Boolean expression based on hypergraphs with algorithm
• On computing stratified structure of Boolean functions from n-cubes

This page was built for publication:

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