Asian Research Journal of Mathematics

On Spanning Tree Packing Number of the Complement of Generalized Petersen Graph and Cocktail Party Graph

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 graph G, the spanning tree packing number of \(\sigma\) (G), is the maximum number of edge-disjoint spanning trees contained in G. In this study, we determined the maximum number of edge-disjoint spanning trees of the generalized petersen graph and cocktail graph.

Keywords: Spanning tree number, petersen graph, edge-disjoint

---

---