鎶ュ憡棰樼洰:On matching polynomial of hypergraphs and extremal spectral problems
鎶?鍛?浜?span lang="EN-US">: 鏉庣孩娴?鏁欐巿锛堟睙瑗垮笀鑼冨ぇ瀛︼級
鎶ュ憡鎽樿锛?a name="_Hlk20294485">In this talk, we investigate some basic properties of matching polynomial of hypergraphs and consequently, some extremal spectral problems can be solved using the matching polynomial method together with hypergraph transformations, some of which are obtained more directly than those found in the literature based on weighted incidence matrix method.
鎶ュ憡鏃堕棿: 2019骞?/span>10鏈?span lang="EN-US">11鏃?/span>(鍛ㄤ簲) 10:30-11:30
2019骞?span lang="EN-US">9鏈?span lang="EN-US">29鏃?/span>