Lower bounds for the spanning tree numbers of two graph products
Abstract
For any graph G of order n, the spanning tree packing number 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.