The Number of Matching Equivalent for the Union Graph of Vertices and Cycles  

作　　者：Xiaoling Wang Xiaoling Wang(School of Mathematics and Statistics, Qinghai Nationalities University, Xining, China)

机构地区：[1]School of Mathematics and Statistics, Qinghai Nationalities University, Xining, China

出　　处：《Applied Mathematics》2021年第6期471-476,共6页应用数学（英文）

摘　　要：For two graphs <em>G</em> and<em> H</em>, if <em>G</em> and <em>H</em> have the same matching polynomial, then <em>G</em> and <em>H</em> are said to be matching equivalent. We denote by <em>δ </em>(<em>G</em>), the number of the matching equivalent graphs of <em>G</em>. In this paper, we give <em>δ </em>(<em>sK</em>₁ ∪ <em>t</em>₁<em>C</em>₉ ∪ <em>t</em>₂<em>C</em>₁₅), which is a generation of the results of in <a href="#ref1">[1]</a>.For two graphs <em>G</em> and<em> H</em>, if <em>G</em> and <em>H</em> have the same matching polynomial, then <em>G</em> and <em>H</em> are said to be matching equivalent. We denote by <em>δ </em>(<em>G</em>), the number of the matching equivalent graphs of <em>G</em>. In this paper, we give <em>δ </em>(<em>sK</em>₁ ∪ <em>t</em>₁<em>C</em>₉ ∪ <em>t</em>₂<em>C</em>₁₅), which is a generation of the results of in <a href="#ref1">[1]</a>.

关 键 词：GRAPH Matching Polynomial Matching Equivalence 

分 类 号：O15[理学—数学]