Lower bounds for the spanning tree numbers of two graph products
classification
🧮 math.CO
keywords
spanningtreeboundsgraphgraphslowernumbernumbers
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.