The average Laplacian polynomial of a graph

DOI10.1016/J.DAM.2020.01.037zbMATH Open1442.05105OpenAlexW3006227093MaRDI QIDQ2192129FDOQ2192129

Ya-Nan Zhang, Haiyan Chen

Publication date: 29 June 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.01.037

zbMATH Keywords

signed graphmatching polynomialaverage Laplacian polynomial

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph polynomials (05C31) Signed and weighted graphs (05C22)

Cites Work

• Signless Laplacians of finite graphs
• On the Laplacian coefficients of signed graphs
• Eigenvalue bounds for the signless laplacian
• Title not available (Why is that?)
• Problems in algebraic combinatorics
• On the matching polynomial of subdivision graphs
• Title not available (Why is that?)

Cited In (4)

• Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs
• On the unimodality of average edge cover polynomials
• Approximating average parameters of graphs
• On the location of zeros of the Laplacian matching polynomials of graphs

This page was built for publication: The average Laplacian polynomial of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192129)