Matchings and walks in graphs
From MaRDI portal
Publication:3918152
Recommendations
Cites work
Cited in
(58)- Spanning trees in regular graphs
- Matching polynomials: A matrix approach and its applications
- The second largest eigenvalue of a tree
- The partition polynomial of a finite set system
- Clique polynomials and independent set polynomials of graphs
- Computing the average parallelism in trace monoids.
- Interlacing families and the Hermitian spectral norm of digraphs
- On immanants of Jacobi-Trudi matrices and permutations with restricted position
- Matching behaviour is asymptotically normal
- Which non-regular bipartite integral graphs with maximum degree four do not have 1 as eigenvalues?
- A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
- On the location of zeros of the Laplacian matching polynomials of graphs
- Atoms of the matching measure
- A refined Gallai-Edmonds structure theorem for weighted matching polynomials
- Faster exponential-time algorithms for approximately counting independent sets
- Spectrahedrality of hyperbolicity cones of multivariate matching polynomials
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- The matching energy of random graphs
- Spatial mixing and the connective constant: optimal bounds
- On a conjecture of Wilf
- Gallai-Edmonds structure theorem for weighted matching polynomial
- Spectral moments of regular graphs in terms of subgraph counts
- The higher-order matching polynomial of a graph
- Walk polynomial: a new graph invariant
- Analyticity for classical gasses via recursion
- Graphs characterized by the roots of matching
- Counting matchings and tree-like walks in regular graphs
- Graphs, vectors, and matrices
- Matchings on infinite graphs
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- scientific article; zbMATH DE number 1512193 (Why is no real title available?)
- Closed walks and graphlets
- Developments in the theory of graph spectra
- Growth rates of geometric grid classes of permutations
- Polynomial reconstruction of the matching polynomial
- The complexity of approximating the matching polynomial in the complex plane
- Chromatic roots and limits of dense graphs
- Signatures, lifts, and eigenvalues of graphs
- Fisher zeros and correlation decay in the Ising model
- A note on the matching polynomials of paths and cycles
- The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs
- Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction
- Asymptotic enumeration of Latin rectangles
- Asymptotic enumeration of Latin rectangles
- The component structure of dense random subgraphs of the hypercube
- Matchings on trees and the adjacency matrix: A determinantal viewpoint
- Identities of the multi-variate independence polynomials from heaps theory
- The matching polynomial of the path-tree of a complete graph
- On the matching arrangement of a graph and properties of its characteristic polynomial
- Potential-weighted connective constants and uniqueness of Gibbs measures
- A hypergraph Heilmann-Lieb theorem
- Correlation decay and partition function zeros: algorithms and phase transitions
- The Laplacian characteristic polynomial of the path-tree of the complete graph
- Matching polynomials of path-trees of a complete bipartite graph
- Hoffman program of Laplacian matching polynomials of graphs
- Random matchings in linear hypergraphs
- Eigenvalues of universal covers and the matching polynomial
This page was built for publication: Matchings and walks in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3918152)
