报告主题：On the adjacency matrix of a block graph
报告人： Ravindra B. Bapat 教授（Indian Statistical Institute）
报告时间：2016年5月11日（周三）10:00
报告地点：校本部G507
邀请人：林明华
主办部门：金沙威尼斯欢乐娱人城数学系
报告摘要：A block graph is a graph in which every block is a clique. Let G be a block graph and let A be the adjacency matrix of G. We obtain a formula for the determinant of A over reals. It is shown that A is nonsingular over GF(2) if and only if the removal of any vertex from G produces a graph with exactly one odd component. A formula for the inverse of A is obtained, whenever it exists. We obtain some results for the line graph of a tree, which is a block graph in which every cut-vertex is incident to at most two blocks. A flower, which is a block graph with only one cut-vertex, is also considered. This talk is based on joint work with Souvik Roy
and Ebrahim Ghorbani.
欢迎教师、学生参加 ！
