Laplacian polynomial and number of spanning trees in terms of characteristic polynomial of induced subgraphs

zbMATH Open1185.05101MaRDI QIDQ950661FDOQ950661

Authors: H. B. Walikar, Harishchandra S. Ramane 

Publication date: 3 November 2008

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1823783
• scientific article; zbMATH DE number 3966096
• The coefficients of Laplacian characteristic polynomials of graphs
• Signless Laplacian polynomial and characteristic polynomial of a graph
• Counting the number of spanning trees of graphs

zbMATH Keywords

characteristic polynomialnumber of spanning treesLaplacian polynomial

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05)

Cited In (9)

• Transformations of a graph increasing its Laplacian polynomial and number of spanning trees
• Laplacian immanantal polynomials and the \(\mathsf{GTS}\) poset on trees
• Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications
• Counting the number of spanning trees of graphs
• Signless Laplacian polynomial and characteristic polynomial of a graph
• An alternate proof of the formula for the characteristic polynomial of a threshold graph
• Title not available (Why is that?)
• On the Seidel Laplacian and Seidel signless Laplacian polynomials of graphs
• Title not available (Why is that?)

This page was built for publication: Laplacian polynomial and number of spanning trees in terms of characteristic polynomial of induced subgraphs

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