The Complexity of Wheel Graphs with Multiple Edges and Vertices
Yuxuan Wei, Zhinan Gao, Xingyan Lu
Asian Research Journal of Mathematics · pp. 1–12 · Published 19 Jun 2023
10.9734/arjom/2023/v19i9694Abstract
In this paper, we focus on calculate the number of spanning trees of the general wheel graphs, which means the original wheel graphs adding large amount of vertices and edges. Particularly, we introduce the C-graph and deduce a new equation that computing the spanning trees by removing C-graphs instead of edges. In Addition, we test our results by Kirchhoff’s matrix-tree theorem in some simple cases and provide the tree entropy of the general wheel graphs. Finally, we analyse the relation between the wheel graph and double-wheel graphs and propose the idea of calculating the spanning trees of double-wheel graphs.
Cited by 2
Manal Alotaibi, Ahmad Alghamdi, Hanan Alolaiyan · Symmetry · 2023
Alexander Alexander, Fransiskus Fran, Nilamsari Kusumastuti · JTAM (Jurnal Teori dan Aplikasi Matematika) · 2025
Related research
- V4- Magic Labelings of Some Wheel Related Graphs — shares topic coverage
- Real-World Implementations of Network Centrality Algorithms across Various — shares topic coverage
Article metrics
Real usage data collected on this platform.
24
Page views
0
PDF downloads
2
Outbound clicks
2
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
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.