报告题目：Independent bondage number of graphs

报告摘要: Let  $G=(V;E)$ be a simple finite graph.  A vertex subset $S$ of $G$ is called an independent set if there is no edge between any pair of vertices of $S$ and a dominating set if for any $v\in V-S$, $uv\in E$ for some $u\in S$. If $S$ is both independent and dominating in $G$, then $S$ is an independent dominating set. Let $i(G)$ denote the cardinality of a minimum independent dominating set of $G$ and set $b_i(G)=\min\{|E'|~: E'\subseteq E, i(G)<i(G-E')\}$, which we define as independent bondage number of $G$. In the recent years  a lot of research have been done on investigating the bounds of  $i(G)$, but very little is known about the bounds of $b_i(G)$. We initiate the study on properties of $b_i(G)$ and present some upper and lower bounds on $b_i(G)$ for some special classes of graphs, such as planar graphs and grid graphs.  We will also propose some further research
problems.

报告人简介： 卫兵，现为美国密西西比大学数学系教授、研究生项目负责人，1992年博士毕业于德国柏林工业大学（Technical University of Berlin）。主要从事图的结构性理论、图的参数以及极图理论等方面的研究工作。在对图的圈，路和因子的结构，图的控制数，图的独立多项式等问题的研究中，获得一些深刻的结果。目前已发表科研论文九十余篇；若干国际SCI杂志的专业审稿人；应邀在国际或国内多个学术研究机构从事合作研究。在国内工作期间，曾获得博士后基金、多项国家自然科学基金、留学回国人员基金，香港裘槎基金等项目的资助等；曾经担任中国运筹学会副秘书长、中国图论学会秘书长；曾任中科院研究员、博士生导师。

报告时间：2019年6月6日（周四）上午10:00-10:50
报告地点：长清校区B407报告厅

欢迎各位老师同学参加！