Spanning Tree Packing of Lexicographic Product of Graphs Resulting from Path and Complete Graphs
Isagani S. Cabahug · Asian Research Journal of Mathematics · 2023
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.