Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications

DOI10.1016/j.amc.2023.128187MaRDI QIDQ6096283

Linghai Liu, Weigen Yan

Publication date: 11 September 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

generating functionspanning treeLaplacian matrixalmost complete bipartite graphrooted spanning forest

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (1)

Counting spanning trees of \((1, N\))-periodic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cauchy-Binet for pseudo-determinants
• Determinant identities for Laplace matrices
• A certain polynomial of a graph and graphs with an extremal number of trees
• Counting spanning trees in almost complete multipartite graphs
• Spanning forests and the golden ratio
• On the Number of Distinct Forests
• Enumeration of Forests in a Graph
• The number of rooted forests in circulant graphs

This page was built for publication: Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications