Home   Overview   Faculty   Research   Undergraduate Programs   Graduate Programs   Position Available   Contact Us

Previous Next
 
Home >> Seminar

The nullity of a graph

郭继明 教授(华东理工大学数学系主任)
Sunday, May 5th, 2019, 10:00 AM  闵行数学楼401报告厅
 
报告摘要: Let G=(V(G), E(G)) be a simple connected graph with vertex set V(G)={v_1, v_2, …, v_n} and edge set E(G). Its adjacency matrix A(G)=a_{ij}) is defined as the n by n matrix (a_{ij}), where a_{ij}=1 if v_i is adjacent to v_j, and a_{ij}=0, otherwise.

The nullity of G is the multiplicity of 0 as an eigenvalue of A(G). In this talk, we will introduce some old and new results on the nullity of a graph.

主持人:詹兴致 教授
   
 
 
Links >>
 
Resources >>
 
 
  Other Links >>    Shanghai Mathematical Society    Chinese Mathematical Society    American Mathematical Society    The European Mathematical Society  
         
       Copyright 2012 All rights reserved    Department of Mathematics, East China Normal University    Tel: 86-21-54342609