Laplacian matching polynomial of graphs (Q2196481)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Laplacian matching polynomial of graphs	scientific article

Statements

scholarly article

0 references

Laplacian matching polynomial of graphs (English)

0 references

0 references

Journal of Algebraic Combinatorics

0 references

publication date

2 September 2020

0 references

zbMATH Keywords

graph polynomial

0 references

forest

0 references

matching

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10801-019-00892-9

0 references

Applications of stable polynomials to mixed determinants: Johnson's conjectures, unimodality, and symmetrized Fischer products

0 references

The Determinant of the Adjacency Matrix of a Graph

0 references

Theory of monomer-dimer systems

0 references

Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs

0 references

Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem

0 references

Interlacing families. I: Bipartite Ramanujan graphs of all degrees

0 references

0 references

Bounding the largest eigenvalue of trees in terms of the largest vertex degree

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S10801-019-00892-9

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2196481

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2196481&oldid=38936125"