05C50 Online Seminar Series: RB Bapat
Topic
Resistance matrix of a balanced directed graph
Speakers
Details
We first review some known results about resistance matrix of an undirected graph. We then define resistance distance in a strongly connected, directed graph. When the graph is balanced, that is, the indegree and the outdegree of any vertex are the same, we show that many properties of resistance matrix continue to hold. The definition of resistance distance uses the Moore-Penrose inverse of the Laplacian matrix of the graph. Some open problems are proposed. The talk is based on joint work with R. Balaji and Shivani Goel.
Additional Information
05C50 Online is a virtual seminar about graphs and matrices held twice a month on a Friday, 8AM Pacific Time/ 10AM Central Time via Zoom.
For more information, visit: https://sites.google.com/view/05c50online/home.
If you would like to attend, please register using this form to receive the zoom links: https://docs.google.com/forms/d/e/1FAIpQLSdQ98fh58cgeSWzbFe3t77i28FXDck1gYuX9jv_qd4kEf5l_Q/viewform?usp=sf_link
RB Bapat, Indian Statistical Institute