The Determinant of the Adjacency Matrix of a Graph
From MaRDI portal
Cited in
(76)- Permanental polynomials of graphs
- Tree counting polynomials for labelled graphs. I: Properties
- \(LDL^ T\) factorizations of adjacency matrices where \(D\) is block diagonal
- Some determinant expansions and the matrix-tree theorem
- On characteristic and permanent polynomials of a matrix
- Computation of maximum likelihood estimates in cyclic structural equation models
- Rectifying a misbelief: Frank Harary's role in the discovery of the coefficient-theorem in chemical graph theory
- Rigid linkages and partial zero forcing
- Spectrally arbitrary patterns over rings with unity
- A formula for all minors of the adjacency matrix and an application
- A Harary-Sachs theorem for hypergraphs
- Characteristic power series of graph limits
- Applications of the Harary-Sachs theorem for hypergraphs
- Laplacian matching polynomial of graphs
- Parameterized complexity of determinant and permanent
- Hyperbolic surfaces with sublinearly many systoles that fill
- A reduction formula for the characteristic polynomial of hypergraph with pendant edges
- A unified view on bipartite species-reaction graphs and their relation to interaction graphs and qualitative dynamics of chemical reaction networks
- On Randić energy
- Odd 2-factored snarks
- Two graphs with a common edge
- The characteristic polynomial of a graph
- A graph polynomial and its applications
- Moore graphs and cycles are extremal graphs for convex cycles
- Mathematical aspects of omega polynomial
- On the Characteristic Equations of the Characteristic Polynomial
- Relations between connected and self-avoiding hikes in labelled complete digraphs
- Graph invertibility and median eigenvalues
- SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM
- Algorithms for finding directed graph isomorphisms by finite automata
- On the Number of Nonzeros Added when Gaussian Elimination is Performed on Sparse Random Matrices
- A new expression for matching polynomials
- Automorphism group and category of cospectral graphs
- Matrix measures for transitivity and balance*
- Isospectral polygons, planar graphs and heat content
- Autocatalytic networks: an intimate relation between network topology and dynamics
- Binomial incidence matrix of a semigraph
- Inverses of non-bipartite unicyclic graphs with a unique perfect matching
- scientific article; zbMATH DE number 7640506 (Why is no real title available?)
- scientific article; zbMATH DE number 7640508 (Why is no real title available?)
- On the adjacency matrix of a complex unit gain graph
- Input-output networks, singularity theory, and homeostasis
- Inverting non-invertible labeled trees
- scientific article; zbMATH DE number 7090165
- On a conjecture about the μ-permanent
- Drum Shapes and Isospectral Graphs
- Perfect graphs and complex surface singularities with perfect local fundamental group
- On the multiple eigenvalue of Randić matrix of trees
- On the spectral properties of Feigenbaum graphs
- Spectral moments of hypertrees and their applications
- Automorphism groups of Cayley evolution algebras
- Sensor fault detection and isolation via networked estimation: rank-deficient dynamical systems
- The determinant of an antiadjacency matrix of a directed cycle graph with chords
- Balance theory: an extension to conjugate skew gain graphs
- Gröbner bases, symmetric matrices, and type C Kazhdan–Lusztig varieties
- Singular graphs and the reciprocal eigenvalue property
- Unifying adjacency, Laplacian, and signless Laplacian theories
- Balance in gain graphs - a spectral analysis
- Ergodic concepts for a self-organizing trivalent spin network: a path to \((2+1)\)-D black hole entropy
- Bicyclic inverses of bicyclic graphs with a unique perfect matching
- On sign-invertible graphs
- Unique Nash equilibrium of a nonlinear model of opinion dynamics on networks with friction-inspired stubbornness
- Combinatorial explanation of coefficients of the signless Laplacian characteristic polynomial of a digraph
- Determinantal decomposition of graphs with a unique perfect matching
- Towards a structural characterization of unimodular graphs with a unique perfect matching
- Maximizing adjacency determinant over k-cyclic graphs with a unique perfect matching: a complete characterization
- On the equivalence between Sachs extendability and Sachs criticality
- On the determinant of Kőnig-Egerváry graphs
- Main eigenvalues for normal matrices and mixed graphs
- Eigenvalues of universal covers and the matching polynomial
- The SD-KE decomposition through the Larson matching interface
- New structural bounds for \(\operatorname{ker}(G)\) and \(\operatorname{core}(G)\)
- A reduced Mason's rule for solving linear systems of equations recursively: an application to the integrated ownership problem in a network of companies
- Integer LU-factorizations
- A graph-theoretic method for the basic reproduction number in continuous time epidemiological models
- On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
This page was built for publication: The Determinant of the Adjacency Matrix of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3850469)