Enumeration of spanning trees of graph: alternative methods

DOI10.1504/IJMOR.2011.038909MaRDI QIDQ2431526zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 15 April 2011

Published in International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijmor.2011.038909

zbMATH Keywords

communication systemscut setdistributed networkselectrical networksgraph spanning treesgraph theoryincidence matrixnetwork analysisoptimisationpower systemstie set

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14)

Recommendations

• An algorithm for the enumeration of spanning trees
• New method for counting the number of spanning trees in a two-tree network
• Linear algebraic techniques for spanning tree enumeration
• An iteration method for computing the total number of spanning trees and its applications in graph theory
• Enumeration of spanning trees in planar unclustered networks

Cited in

(6)

• Critical analysis of the spanning tree techniques
• scientific article; zbMATH DE number 1210904 (Why is no real title available?)
• scientific article; zbMATH DE number 1066967 (Why is no real title available?)
• Spanning trees and hierarchical networks
• Faster enumeration of all spanning trees of a directed graph
• scientific article; zbMATH DE number 7771742 (Why is no real title available?)

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: Enumeration of spanning trees of graph: alternative methods

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