Skip to main content
Book Chapter

Non-negative matrices and digraphs

Springer New York, (2012), 2082-2095
DOI: 10.1007/978-1-4614-1800-9_132
6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Article Outline: Glossary Definition of the Subject Introduction Matrices, Graphs and Digraphs Irreducible Nonnegative Matrices and Their Digraphs Special Irreducible Matrices Reducible Nonnegative Matrices and Their Digraphs Examples: Ranking Problems The Laplacian Matrix of a Directed Graph Research Directions Bibliography

Cite

CITATION STYLE

APA

Berman, A., & Shaked-Monderer, N. (2012). Non-negative matrices and digraphs. In Computational Complexity: Theory, Techniques, and Applications (Vol. 9781461418009, pp. 2082–2095). Springer New York. https://doi.org/10.1007/978-1-4614-1800-9_132

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free