Lower bounds for the spanning tree numbers of two graph products

preprint2013arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Lower bounds for the spanning tree numbers of two graph products

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0