应姚海元副教授、陈祥恩教授、刘霞副教授邀请，西北工业大学软件学院石玲娟博士将与太阳成t官网师生在线上做学术交流并做专题学术报告。
报告题目：Some recent works of maximal matchings in graphs
报告摘要：A matching of graph Gis maximalif it cannot be expanded by adding any edge to create a larger matching. Doslic et al. obtained general generating functions for the numbers of maximal matchings in three classes of benzenoid chains. By using the Hosoya vector and k-matching vector, Cruz et al. and Oz et al. researched the Hosoya index and the k-matching number of benzenoids, respectively. Inspired by these results, by using the maximal matching vector, we show that the number of maximal matchings of a benzenoid chain with n hexagons equals to the product of n certain matrices, each of which is S, L or R according to the type of the connection mode of the benzenoid chain. And by applying the perfect matching vector and maximal matching vector at a path of double hexagonal chain, we obtained the numbers of perfect matchings and maximal matchings of a double hexagonal chain with n naphthalenes. For a hexagonal ring H with n hexagons, we show that the number of maximal matchings of H equals to the trace of the product of n matrices, each of which is also S, L or R according to the type of the connection mode of H. Finally, we extend this conclusion to arbitrary polygon rings and provide an algorithm to determine the transition matrices of polygon chains (rings).
报告时间：2024年11月21日17:00
报告地点：腾讯会议（330-436-918）
邀 请 人：姚海元副教授、陈祥恩教授、刘霞副教授
届时欢迎广大师生参与交流！
报告人简介：
石玲娟，西北工业大学助理教授，硕士生导师。2018年毕业于兰州大学应用数学专业，获理学博士学位。主要研究领域为图论及其应用、生物信息学，现已在国际刊物上以第一作者发表学术论文10余篇。主持国家自然科学基金和陕西省自然科学基金各1项。
甘肃省数学与统计学基础学科研究中心
太阳成tyc7111cc
