Counting spanning trees in cographs: an algorithmic approach

MaRDI QIDQ3073568zbMATH OpenFDO

Authors Stavros D. Nikolopoulos, Charis Papadopoulos

Publication date 11 February 2011

zbMATH Keywords

complexitymodular decompositionnumber of spanning tree\(P_{4}\)-reducible graph

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Enumeration in graph theory (05C30)

Recommendations

• Counting spanning trees in graphs using modular decomposition
• Counting spanning trees using modular decomposition
• scientific article; zbMATH DE number 2127724
• An algorithm for the enumeration of spanning trees
• Linear algebraic techniques for spanning tree enumeration

Cited in

(3)

• A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
• Counting spanning trees in graphs using modular decomposition
• Counting spanning trees using modular decomposition

This page was built for publication: Counting spanning trees in cographs: an algorithmic approach

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