Random matrices and graphs

DOI10.1007/BF02163181MaRDI QIDQ2522339zbMATH OpenFDO

Authors B. R. Heap

Publication date 1966

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/131691

zbMATH Keywords

probability theory

Cites work

• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3254909 (Why is no real title available?)
• scientific article; zbMATH DE number 3390820 (Why is no real title available?)
• scientific article; zbMATH DE number 3085434 (Why is no real title available?)
• A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues
• A Theorem on Boolean Matrices
• A graph theoretic approach to matrix inversion by partitioning
• Random Graphs
• The Number of Components in Random Linear Graphs

Cited in

(5)

• On the Number of Nonzeros Added when Gaussian Elimination is Performed on Sparse Random Matrices
• Fuzzy intersection graphs
• On the roots of strongly connected reliability polynomials
• The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane
• On the Gaussian elimination method for inverting sparse matrices

This page was built for publication: Random matrices and graphs

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