報(bào)告題目:Spanning Trees and Eigenvalues of a Graph
報(bào)告時(shí)間:2024年4月12日(星期五)上午10:30-11:30
報(bào)告地點(diǎn):理學(xué)院B315
主辦單位:理學(xué)院
報(bào)告人:李建喜
報(bào)告人簡(jiǎn)介:
李建喜,閩南師范大學(xué)數(shù)學(xué)與統(tǒng)計(jì)學(xué)院教授、碩士生導(dǎo)師,省級(jí)研究生導(dǎo)師團(tuán)隊(duì)(運(yùn)籌學(xué)與控制論)負(fù)責(zé)人。入選福建省高等學(xué)校新世紀(jì)優(yōu)秀人才計(jì)劃。主要研究方向?yàn)閳D的譜理論及其應(yīng)用,已在Electron. J. Combin., Linear Algebra Appl., Discrete Appl. Math.,等期刊發(fā)表學(xué)術(shù)論文50余篇。
報(bào)告內(nèi)容簡(jiǎn)介:
In this talk, we focus on the existence of some kinds of spanning trees in a graph, and report some sufficient conditions (involving eigenvalues and size) to guarantee the corresponding graph to have a certain spanning tree.