scientific article; zbMATH DE number 3747179

zbMATH Open0476.05060MaRDI QIDQ3933016FDOQ3933016

Authors: Ivan Gutman, Chris Godsil 

Publication date: 1981

Title of this publication is not available (Why is that?)

zbMATH Keywords

characteristic polynomialmatching polynomialindependent edges

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (31)

• Open problems in the spectral theory of signed graphs
• Spectra of power hypergraphs and signed graphs via parity-closed walks
• A new expression for matching polynomials
• On the unimodality of average edge cover polynomials
• The matching polynomials of hypergraphs and weighted hypergraphs
• Signatures, lifts, and eigenvalues of graphs
• On a conjecture of Wilf
• Noncommutativity makes determinants hard
• Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
• Clifford algebras and approximating the permanent
• The characteristic polynomial and the matchings polynomial of a weighted oriented graph
• A general law of large permanent
• An efficient algorithm for computing permanental polynomials of graphs
• On immanants of Jacobi-Trudi matrices and permutations with restricted position
• On the matching and permanental polynomials of graphs
• Approximating the permanent: A simple approach
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
• On the largest eigenvalue of a mixed graph with partial orientation
• An analysis of Monte Carlo algorithm for estimating the permanent
• The algebraic multiplicity of the spectral radius of a uniform hypertree
• Non-commutative circuits and the sum-of-squares problem
• An algorithm for calculating the independence and vertex-cover polynomials of a graph
• Ramanujan coverings of graphs
• Determinants of Seidel tournament matrices
• Concentration of permanent estimators for certain large matrices.
• The average Laplacian polynomial of a graph
• A load balancing strategy for parallel computation of sparse permanents.
• Spectrahedrality of hyperbolicity cones of multivariate matching polynomials
• Random path method with pivoting for computing permanents of matrices
• Interlacing families and the Hermitian spectral norm of digraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3933016)