Random matrices and graphs

DOI10.1007/BF02163181zbMath0139.33304MaRDI QIDQ2522339

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

Related Items (5)

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

Cites Work

• A graph theoretic approach to matrix inversion by partitioning
• A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues
• The Number of Components in Random Linear Graphs
• Random Graphs
• A Theorem on Boolean Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Random matrices and graphs