Classifications of Resistance Distances in Simple Graphs

Abstract

Within graph theory, there are multiple distance metrics which can describe the concept of “distance” between nodes on a simple graph, which are of particular interest to researchers studying link prediction and network evolution. This talk will focus on the relationship between measures of distance in simple graphs and various features of these graphs. I will discuss classifying graphs in which any edge resistance is greater than any non-edge resistance, using Katz centrality scores and classical graph theoretical features.