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

Isagani S. Cabahug, Jr.

doi:10.9734/arjom/2023/v19i9714

Research Article Open access CC BY 4.0

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

Isagani S. Cabahug, Jr.

Asian Research Journal of Mathematics · pp. 226–232 · Published 21 Jul 2023

10.9734/arjom/2023/v19i9714

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.

Spanning tree number petersen graph edge-disjoint

Cited by 0

No indexed citations yet.

Access this article

View at publisher

Cite this article

Isagani S. Cabahug, Jr. (2023). On Spanning Tree Packing Number of the Complement of Generalized Petersen Graph and Cocktail Party Graph. Asian Research Journal of Mathematics , 226–232. https://doi.org/10.9734/arjom/2023/v19i9714

Affiliations

Isagani S. Cabahug, Jr. — Department of Mathematics, College of Arts and Sciences, Central Mindanao University, Musuan, Maramag, Bukidnon, Philippines.

Metrics

0
Views: 0
Downloads: 0
Citations: 0
Outbound

Full metrics

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.