Indexing Simple Graphs by Means of the Resistance Distance


For every simple connected graph, we present a polynomial time algorithm for computing a numerical index, which is composed of primary and secondary parts. Given a graph G = (V, E) where V and E are, respectively, vertex and edge sets, the primary part of the index is a set of |V | fractions and the secondary part of the index is a set of |B| x |V… (More)
DOI: 10.1109/ACCESS.2016.2606764

7 Figures and Tables


  • Presentations referencing similar topics