»ã±¨±êÌâ (Title)£ºThe number of maximum dissociation sets in trees£¨Ê÷ÖÐ×î´ó·ÖÀ뼯µÄÊýÁ¿£©

»ã±¨ÈË (Speaker)£ºÊ·ÓÀÌà ½ÌÊÚ£¨ÄÏ¿ª´óѧ£©

»ã±¨¹¦·ò (Time)£º2022Äê8ÔÂ27ÈÕ (ÖÜÁù) 15:00

»ã±¨µØÖ· (Place)£ºÌÚѶ»áÒ飨»áÒéºÅ£º889-804-896£©

Ô¼ÇëÈË(Inviter)£ººÎ׿ºâ

Ö÷°ì²¿ÃÅ£ºÀíѧԺÊýѧϵ

»ã±¨ÌáÒª£º

A subset of vertices is a maximum independent set if no two of the vertices are adjacent and the subset has maximum cardinality. A subset of vertices is called a maximum dissociation set if it induces a subgraph with vertex degree at most 1, and the subset has maximum cardinality. In this talk, we will introduce the result on the maximum number of maximum dissociation sets in trees. Joint work with Jianhua Tu and Zhipeng Zhang.