The Matching Polynomial of the Path-Tree of the Complete Tripartite Graph <math display='inline' xmlns='http://www.w3.org/1998/Math/MathML'> <mrow> <msub> <mi>K</mi> <mrow> <mn>1</mn><mo>,</mo&

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.