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). pp. 178-182. ISSN 2456-477X
![[thumbnail of Cabahug1992023ARJOM102743.pdf]](http://eprints.go4mailburst.com/style/images/fileicons/text.png)
Text
Cabahug1992023ARJOM102743.pdf - Published Version
Download (511kB)
Official URL: https://doi.org/10.9734/arjom/2023/v19i9710
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.
| Item Type: | Article |
|---|---|
| Subjects: | GO for ARCHIVE > Mathematical Science |
| Depositing User: | Unnamed user with email support@goforarchive.com |
| Date Deposited: | 19 Sep 2023 09:44 |
| Last Modified: | 19 Sep 2023 09:44 |
| URI: | http://eprints.go4mailburst.com/id/eprint/1112 |
Actions (login required)
- View Item