Godsil, C.D. (1993) Algebraic Combinatorics. Chapman and Hall.

has been cited by the following article:

• TITLE: The Matching Polynomial of the Path-Tree of the Complete Tripartite Graph K 1,s,t

  AUTHORS: Yangguang Ma

  KEYWORDS: Matching Polynomial, Path-Tree, Complete Tripartite Graph

  JOURNAL NAME: Applied Mathematics, Vol.16 No.7, July 28, 2025

  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.