2023
DOI: 10.9734/arjom/2023/v19i9694
|View full text |Cite
|
Sign up to set email alerts
|

The Complexity of Wheel Graphs with Multiple Edges and Vertices

Abstract: In this paper, we focus on calculate the number of spanning trees of the general wheel graphs, which meansthe original wheel graphs adding large amount of vertices and edges. Particularly, we introduce the C-graphand 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 thetree entropy of the general wheel graphs. Finally, we analyse the relation between the wheel graph a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…In 2022, Kuswardi et al [21] investigated the chromatic number of the amalgamation of wheel graphs. In June 2023, Wei et al [22] studied the complexity of wheel graphs with multiple edges and vertices. In July 2023, Greeni et al [23] explained the embedding of a complete bipartite graph into a wheel-related graph.…”
Section: Literature Review Of Studies Of Wheel Graphsmentioning
confidence: 99%
“…In 2022, Kuswardi et al [21] investigated the chromatic number of the amalgamation of wheel graphs. In June 2023, Wei et al [22] studied the complexity of wheel graphs with multiple edges and vertices. In July 2023, Greeni et al [23] explained the embedding of a complete bipartite graph into a wheel-related graph.…”
Section: Literature Review Of Studies Of Wheel Graphsmentioning
confidence: 99%