Lower bounds for the spanning tree numbers of two graph products

MaRDI QIDQ6243227zbMATH OpenFDO

Authors Hengzhe Li, Xueliang Li, Yaping Mao, Jun Yue

Publication date 9 July 2013

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Abstract: For any graph $G$ of order $n$, the spanning tree packing number emph{$STP(G)$}, is the maximum number of edge-disjoint spanning trees contained in $G$. In this paper, we obtain some sharp lower bounds for the spanning tree numbers of Cartesian product graphs and Lexicographic product graphs.

This page was built for publication: Lower bounds for the spanning tree numbers of two graph products

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