scientific article; zbMATH DE number 3747179

MaRDI QIDQ3933016zbMATH OpenFDO

Authors Ivan Gutman, Chris Godsil

Publication date 1981

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

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)