Spanning Tree Packing of Lexicographic Product of Graphs Resulting from Path and Complete Graphs
Asian Research Journal of Mathematics · pp. 178–182 · Published 21 Jul 2023
10.9734/arjom/2023/v19i9710Abstract
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.
Cited by 1
Liming Wang, Feng Li, Linlin Cui · International Journal of Parallel, Emergent and Distributed Systems · 2026
Related research
- Pairing Quantitative and Qualitative Analyses during Flooding Event in Mamiá Lake (Amazon River) — shares topic coverage
- Effectiveness of Feedback and How It Contributes to Improved Instruction and Learner Performance: A Case Study of Newly Qualified Mathematics Educators in Johannesburg West Schools in Gauteng Province — shares topic coverage
- Developing a New Teaching Paradigm for the 21st Century Learners in the Context of Socratic Methodologies — shares topic coverage
- A Grading System for Evaluating Geospatial Entity Connectivity from Texts Using Co-occurrences, Semantic Similarity and Geodesic Distance — shares topic coverage
- Forest Core Demarcation Using Geo-Spatial Techniques: A Habitat Management Approach in Panchet Forest Division, Bankura, West Bengal, India — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
1
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.