Abstract
For any graphs G of order n, the spanning tree packing number, denoted by, of a graph G is the maximum number of edge disjoint spanning tree contained in G. In this study determine the spanning packing number of lexicographic product of graphs resulting from two path graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have