Research ArticleOpen AccessGoogle Scholar indexed
The Matching Polynomial of the Path-Tree of the Complete Tripartite Graph K 1 , s , t
School of Mathematics and Statistics, Qinghai Minzu University, Xining, China
- 1 School of Mathematics and Statistics, Qinghai Minzu University, Xining, China
Copy link · social · email
Abstract
Let G be a complete tripartite graph with n vertices. Its vertex set is U ∪ V ∪ W , where | U | = 1 , | V | = s , | W | = t , and this graph is denoted as K 1 , s , t . Let T 1 , s , t ω denote the path-tree corresponding to the vertex ω ∈ U ∪ V ∪ W . In this paper, we mainly present the matching polynomial of the path-tree T 1 , s , t ω corresponding to the complete tripartite graph.
KeywordsMatching PolynomialPath-TreeComplete Tripartite Graph
- Farrell, E.J. (1979) An Introduction to Matching Polynomials. Journal of Combinatorial Theory , Series B , 27, 75-86. https://doi.org/10.1016/0095-8956(79)90070-4
- Godsil, C.D. and Gutman, I. (1981) On the Theory of the Matching Polynomial. Journal of Graph Theory , 5, 137-144. https://doi.org/10.1002/jgt.3190050203
- Godsil, C.D. (1981) Matchings and Walks in Graphs. Journal of Graph Theory , 5, 285-297. https://doi.org/10.1002/jgt.3190050310
- Godsil, C.D. (1993) Algebraic Combinatorics. Chapman and Hall.
- Li, X., Zhao, H. and Wang, L. (2003) A Complete Solution to a Conjecture on the Β-Polynomials of Graphs. Journal of Mathematical Chemistry , 33, 189-193. https://doi.org/10.1023/a:1024738623798
- Guo, M. and Chen, H. (2024) The Matching Polynomial of the Path-Tree of a Complete Graph. Discrete Applied Mathematics , 359, 244-249. https://doi.org/10.1016/j.dam.2024.08.005
- Chen, H. and Yuan, Y. (2025) Matching Polynomials of Path-Trees of a Complete Bipartite Graph. Discrete Applied Mathematics , 372, 173-179. https://doi.org/10.1016/j.dam.2025.04.014
- Cvetković, D.M., Gutman, I., Doob, M. and Torgašev, A. (1988) Recent Results in the Theory of Graph Spectra. North Holland.