The DOI matches its Crossref record.
Combinatorial Matrix Theory
Abstract
This book, first published in 1991, is devoted to the exposition of combinatorial matrix theory. This subject concerns itself with the use of matrix theory and linear algebra in proving results in combinatorics (and vice versa), and with the intrinsic properties of matrices viewed as arrays of numbers rather than algebraic objects in themselves. There are chapters dealing with the many connections between matrices, graphs, digraphs and bipartite graphs. The basic theory of network flows is developed in order to obtain existence theorems for matrices with prescribed combinatorial properties and to obtain various matrix decomposition theorems. Other chapters cover the permanent of a matrix, and Latin squares. The final chapter deals with algebraic characterizations of combinatorial properties and the use of combinatorial arguments in proving classical algebraic theorems, including the Cayley-Hamilton Theorem and the Jordan Canonical Form. The book is sufficiently self-contained for use as a graduate course text, but complete enough for a standard reference work on the basic theory. Thus it will be an essential purchase for combinatorialists, matrix theorists, and those numerical analysts working in numerical linear algebra.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Second-Order Consensus for Multiagent Systems With Directed Topologies and Nonlinear Dynamics
Yu, W., Chen, G., Cao, M., & Kurths, J. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2031624 · Cited by 1,120
Which graphs are determined by their spectrum?
van Dam, E. R., & Haemers, W. H. (2003) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(03)00483-x · Cited by 654
Consensus in multi‐agent systems with communication constraints
Wen, G., Duan, Z., Yu, W., & Chen, G. (2012) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.1687 · Cited by 315
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
Valiant, L. G. (2002) · SIAM Journal on Computing · doi:10.1137/s0097539700377025 · Cited by 311
Veerman, J. J. P., Lafferriere, G., Caughman, J. S., & Williams, A. (2005) · Journal of Statistical Physics · doi:10.1007/s10955-005-6999-9 · Cited by 61
Metadata
- Authors
- Brualdi, R. A., & Ryser, H. J.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 1991-07-26
- OpenAlex
- W4299798129
- Cited by
- 1,046
- References
- 0
- FWCI
- 5.78
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Combinatorial Matrix Theory. https://app.cochat.ai/papers/10.1017/cbo9781107325708
- The paper
- Brualdi, R. A., & Ryser, H. J. (1991). Combinatorial Matrix Theory. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9781107325708
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.