加入收藏  || English Version 
 
胡小兰博士和祝宝宣博士学术报告

  发布日期:2016-04-05  浏览量:743


学术报告一

报告题目: Upper bounds on adjacent vertex distinguishing total chromatic number of graphs

: 胡小兰 博士(华中师范大学 助理研究员)

报告时间: 20164 9(周六)下午15:00-16:00

报告地点: 磬苑校区澳门赌搏网站大全H306

报告一摘要An adjacent vertex distinguishing total coloring of a graph G is a proper total coloring of G such that for any pair of adjacent vertices, the set of colors appearing on the vertex and incident edges are different. The minimum number of colors required for an adjacent vertex distinguishing total coloring of G is denoted by .  Let G be a graph, and  and  be chromatic number and edge chromatic number of G, respectively. In this talk, we show that  for any graph G with , and  for any graph.

学术报告二

报告题目: Unimodality problems of independence polynomials

: 祝宝宣 博士 (江苏师范大学 副教授)

报告时间: 20164 9(周六)下午16:00-17:00

报告地点: 磬苑校区澳门赌搏网站大全H306

报告二摘要For a finite and simple graph G, let  denote the number of independent sets of cardinality k in G. Then its generating function

is called the independence polynomial of G. There are many open problems and conjectures on unimodality of independence polynomials. Some recent development will be reported.

欢迎各位老师、同学届时前往!

                                              澳门赌搏网站大全

                                            201645

打印此页】【顶部】【关闭
   
版权所有 2019 澳门赌搏网站大全 All rights reserved 皖ICP备05018241号
地址:安徽省合肥市九龙路111号澳门新莆京娱乐网站磬苑校区理工楼H楼 邮编:230601 E-mail:math@ahu.edu.cn
访问统计:自2013年9月1日以来总访问:1000  后台管理


XML 地图 | Sitemap 地图