Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 236

The DOI matches its Crossref record.

The Determinant of the Adjacency Matrix of a Graph

Harary, Frank · 1962 · SIAM Review

Abstract

Previous article Next article The Determinant of the Adjacency Matrix of a GraphFrank HararyFrank Hararyhttps://doi.org/10.1137/1004057PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] C. L. Coates, Flow graph solutions of linear algebraic equations, IRE Transactions on Circuit Theory, CT-6 (1959), 170–187 CrossrefGoogle Scholar[2] Lothar Collatz and , Ulrich Sinogowitz, Spektren endlicher Grafen, Abh. Math. Sem. Univ. Hamburg, 21 (1957), 63–77 MR0087952 (19,443b) 0077.36704 CrossrefGoogle Scholar[3] C. A. Desoer, The optimum formula for the gain of a flow graph or a simple derivation of Coates' formula, Proc. IRE, 48 (1960), 883–889 CrossrefISIGoogle Scholar[4] Frank Harary, A graph theoretic method for the complete reduction of a matrix with a view toward finding its eigenvalues, J. Math. Phys., 38 (1959/1960), 104–111 MR0109793 (22:678) 0087.01701 CrossrefGoogle Scholar[5] D. König, Theorie der endlichen und unendlichen Graphen, Leipzig, 1936, reprinted New York, 1950 0013.22803 Google Scholar[6] G. Pólya and , G. Szegö, Aufgaben und Lehrsatze aus der Analysis, vol. 2, Berlin, 1925, reprinted New York, 1945; p. 98 Google Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails Applications of the Harary-Sachs theorem for hypergraphsLinear Algebra and its Applications, Vol. 649 | 1 Sep 2022 Cross Ref Sensor Fault Detection and Isolation via Networked Estimation: Rank-Deficient Dynamical SystemsInternational Journal of Control | 24 August 2022 Cross Ref On the adjacency matrix of a complex unit gain graphLinear and Multilinear Algebra, Vol. 70, No. 9 | 12 June 2020 Cross Ref Deep learning in the COVID-19 epidemic: A deep model for urban traffic revitalization indexData & Knowledge Engineering, Vol. 135 | 1 Sep 2021 Cross Ref Spectral moments of hypertrees and their applicationsLinear and Multilinear Algebra, Vol. 13 | 15 July 2021 Cross Ref A Harary-Sachs theorem for hypergraphsJournal of Combinatorial Theory, Series B, Vol. 149 | 1 Jul 2021 Cross Ref Binomial incidence matrix of a semigraphDiscrete Mathematics, Algorithms and Applications, Vol. 13, No. 03 | 20 October 2020 Cross Ref The solution of vibroacoustic linear systems as a finite sum of transmission pathsMechanical Systems and Signal Processing, Vol. 153 | 1 May 2021 Cross Ref On the multiple eigenvalue of Randić matrix of treesLinear and Multilinear Algebra, Vol. 69, No. 6 | 2 June 2019 Cross Ref A reduction formula for the characteristic polynomial of hypergraph with pendant edgesLinear Algebra and its Applications, Vol. 611 | 1 Feb 2021 Cross Ref Using Machine Learning to Quantify the Robustness of Network ControllabilityMachine Learning for Networking | 3 March 2021 Cross Ref Autocatalytic Networks: An Intimate Relation between Network Topology and DynamicsBadal Joshi and Gheorghe CraciunSIAM Journal on Applied Mathematics, Vol. 81, No. 4 | 10 August 2021AbstractPDF (521 KB)Parameterized complexity of determinant and permanentTheoretical Computer Science, Vol. 845 | 1 Dec 2020 Cross Ref Inverses of non-bipartite unicyclic graphs with a unique perfect matchingLinear and Multilinear Algebra | 6 September 2020 Cross Ref A Unified View on Bipartite Species-reaction Graphs and Their Relation to Interaction Graphs and Qualitative Dynamics of Chemical Reaction NetworksElectronic Notes in Theoretical Computer Science, Vol. 350 | 1 Sep 2020 Cross Ref Laplacian matching polynomial of graphsJournal of Algebraic Combinatorics, Vol. 52, No. 1 | 6 June 2019 Cross Ref Advances and challenges in single-molecule electron transportReviews of Modern Physics, Vol. 92, No. 3 | 17 July 2020 Cross Ref Stably computing the multiplicity of known roots given leading coefficientsNumerical Linear Algebra with Applications, Vol. 27, No. 2 | 4 December 2019 Cross Ref On the spectral properties of Feigenbaum graphsJournal of Physics A: Mathematical and Theoretical, Vol. 53, No. 2 | 19 December 2019 Cross Ref Minimal Sufficient Conditions for Structural Observability/Controllability of Composite Networks via Kronecker ProductIEEE Transactions on Signal and Information Processing over Networks, Vol. 6 | 1 Jan 2020 Cross Ref Input-Output Networks, Singularity Theory, and HomeostasisAdvances in Dynamics, Optimization and Computation | 21 July 2020 Cross Ref Automatic generation of fabrication drawings for façade mullions and transoms through BIM modelsAdvanced Engineering Informatics, Vol. 42 | 1 Oct 2019 Cross Ref Spectrally arbitrary patterns over rings with unityLinear Algebra and its Applications, Vol. 576 | 1 Sep 2019 Cross Ref Neural Task Planning With AND–OR Graph RepresentationsIEEE Transactions on Multimedia, Vol. 21, No. 4 | 1 Apr 2019 Cross Ref Computation of maximum likelihood estimates in cyclic structural equation modelsThe Annals of Statistics, Vol. 47, No. 2 | 1 Apr 2019 Cross Ref Organizing Project Actors for Collective Decision-Making about Interdependent RisksComplexity, Vol. 2019 | 20 Mar 2019 C

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/1004057

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 236

Metadata

Authors
Harary, F.
Venue
SIAM Review
Published
1962-07
Volume
4
Issue
3
Pages
202-210
ISSN
  • 0036-1445 (ISSN-L)
  • 1095-7200
OpenAlex
W1985911376
Cited by
236
References
0
FWCI
0.00
Type
journal article
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: The Determinant of the Adjacency Matrix of a Graph. https://app.cochat.ai/papers/10.1137/1004057
The paper
Harary, F. (1962). The Determinant of the Adjacency Matrix of a Graph. SIAM Review. https://doi.org/10.1137/1004057

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.