Hoffman program of Laplacian matching polynomials of graphs
From MaRDI portal
Cites work
- An introduction to the theory of graph spectra
- Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs
- Developments on the Hoffman program of graphs
- Eigenvalues of the Laplacian of a graph∗
- Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines
- Graph polynomials
- Graphs whose signless Laplacian spectral radius does not exceed the Hoffman limit value
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 3747179 (Why is no real title available?)
- scientific article; zbMATH DE number 3465473 (Why is no real title available?)
- scientific article; zbMATH DE number 3512165 (Why is no real title available?)
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Laplacian matching polynomial of graphs
- Limit points of A_-matrices of graphs
- Matchings and walks in graphs
- On limit points of Laplacian spectral radii of graphs
- On the location of zeros of the Laplacian matching polynomials of graphs
- Subdivision method in the Laplacian matching polynomial
- The average Laplacian polynomial of a graph
- Theory of monomer-dimer systems
This page was built for publication: Hoffman program of Laplacian matching polynomials of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230044)