Article ID Journal Published Year Pages File Type
4647211 Discrete Mathematics 2015 5 Pages PDF
Abstract

The spanning-tree packing number of a graph GG is the maximum number of edge-disjoint spanning trees contained in GG. In this paper, we obtain a sharp lower bound for the spanning-tree packing number of lexicographic product graphs.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Note on the spanning-tree packing number of lexicographic product graphs
Authors
, , , ,