Spanning Tree Packing of Lexicographic Product of Graphs Resulting from Path and Complete Graphs
Isagani S. Cabahug, Jr. *
Department of Mathematics, College of Arts and Sciences, Central Mindanao University, Musuan, Maramag, Bukidnon, Philippines.
*Author to whom correspondence should be addressed.
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.
Keywords: Connectivity, edge-disjoint spanning tree packing number, lexicographic product
How to Cite
Jr., Isagani S. Cabahug,. 2023. “Spanning Tree Packing of Lexicographic Product of Graphs Resulting from Path and Complete Graphs”. Asian Research Journal of Mathematics 19 (9):178-82. https://doi.org/10.9734/arjom/2023/v19i9710.