Back to Search
Start Over
Lower bounds for the spanning tree numbers of two graph products
- Publication Year :
- 2013
- Publisher :
- arXiv, 2013.
-
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.<br />Comment: 11 pages
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....68f37e21b92d986181b233d7b97b8481
- Full Text :
- https://doi.org/10.48550/arxiv.1307.2376