STM Article Repository

Cabahug,, Isagani S. (2023) On Spanning Tree Packing Number of the Complement of Generalized Petersen Graph and Cocktail Party Graph. Asian Research Journal of Mathematics, 19 (9). pp. 226-232. ISSN 2456-477X

[thumbnail of Cabahug1992023ARJOM102763.pdf] Text
Cabahug1992023ARJOM102763.pdf - Published Version
Download (532kB)

Abstract

For any graph G, the spanning tree packing number of
(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.

Item Type: Article
Subjects: GO for ARCHIVE > Mathematical Science
Depositing User: Unnamed user with email support@goforarchive.com
Date Deposited: 19 Sep 2023 09:57
Last Modified: 19 Sep 2023 09:57
URI: http://eprints.go4mailburst.com/id/eprint/1116

Actions (login required)

View Item
View Item