Graph Family Characterization using the Path Length Array

Abstract

Distance-based definition of graph families the range in between nodes or sides here on network is known as the shortest route size between both two nodes or sides. The degree of a specific edge is defined as the total number pf triangles that surround that apex. The node e sequence's length level series () is the quantity of nodes but rather vertices at a length I from v, where () = 0(), 1(),…,()(). Here, utilizing their distance extent sequence, they have covered the creation and classification of total circles, cycles of extremely weird and now even dimensions, and complete PPI network 2. In addition, some of the findings have really been provided with methodologies.