Speaker: Yan Weigen, professor and doctoral supervisor, Jimei University

Date: December 10, 2024

Time: 14:30-15:30 pm

Location: Tencent Meeting: 89432956312

Sponsor: Research Center for Mathematics and Interdisciplinary Sciences, Shandong University

Abstract:

Moon’s classical result in [1,2] implies that the number of spanning trees containing a given spanning forest F in a complete graph K_n equalsn^c−2∏^c_i=1n_i, where c is the number of components of F, and n_1, n_2, …, n_c are the numbers of vertices of component of F. In [3], Dong and Ge extended the Moon’s result to the complete bipartite graph. In this talk, we will introduce some of our results on enumeration of spanning trees containing a fixed spanning forest in some graphs. This is joint work with Wuxian Chen and Danyi Li.

[1] J. W. Moon, Counting labelled trees, William Clowes and Sons, Limited, London and Beccles, Canadian Mathematical Congress, 1970.

[2] J. W. Moon, The second moment of the complexity of a graph, Mathematika, 11 (1964), 95-98.

[3] F. M. Dong, J. Ge, Counting spanning trees in a complete bipartite graph which contain a given spanning forest, J. Graph Theory, 101(2022), 79-94

For more information, please visit:

https://www.view.sdu.edu.cn/info/1020/197778.htm