Matchings and walks in graphs
From MaRDI portal
Publication:3918152
DOI10.1002/jgt.3190050310zbMath0466.05053OpenAlexW2055519174MaRDI QIDQ3918152
Publication date: 1981
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190050310
Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Spatial mixing and the connective constant: optimal bounds, Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction, Matching polynomials: A matrix approach and its applications, Which non-regular bipartite integral graphs with maximum degree four do not have \(\pm 1\) as eigenvalues?, Graphs, Vectors, and Matrices, On a conjecture of Wilf, Matchings on infinite graphs, Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs, The component structure of dense random subgraphs of the hypercube, Matchings on trees and the adjacency matrix: A determinantal viewpoint, The characteristic polynomial and the matchings polynomial of a weighted oriented graph, Analyticity for classical gasses via recursion, Gallai-Edmonds structure theorem for weighted matching polynomial, Computing the average parallelism in trace monoids., Signatures, Lifts, and Eigenvalues of Graphs, Spectral moments of regular graphs in terms of subgraph counts, A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix, Interlacing families and the Hermitian spectral norm of digraphs, The second largest eigenvalue of a tree, The partition polynomial of a finite set system, Growth rates of geometric grid classes of permutations, Faster exponential-time algorithms for approximately counting independent sets, Chromatic roots and limits of dense graphs, Asymptotic enumeration of Latin rectangles, Asymptotic enumeration of Latin rectangles, Unnamed Item, Counting Matchings and Tree-Like Walks in Regular Graphs, Fisher zeros and correlation decay in the Ising model, On immanants of Jacobi-Trudi matrices and permutations with restricted position, Developments in the theory of graph spectra, Matching behaviour is asymptotically normal, On the location of zeros of the Laplacian matching polynomials of graphs, Spanning trees in regular graphs, Polynomial reconstruction of the matching polynomial, Spectrahedrality of hyperbolicity cones of multivariate matching polynomials, The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs, A refined Gallai-Edmonds structure theorem for weighted matching polynomials, Interlacing families. I: Bipartite Ramanujan graphs of all degrees, Clique polynomials and independent set polynomials of graphs, The matching energy of random graphs
Cites Work
