Classifications of Electrical Resistance Distance in Simple Graphs

Abstract

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