论文标题
基于邻接函数矩阵的图形比较
Graph Comparison Based on Adjacency Function Matrix
论文作者
论文摘要
在本文中，我们提出了一个新的度量距离，用于比较两个大图，以根据图中所有顶点的最重要的图形结构属性之一（即节点邻接信息）找到它们之间的相似性和差异。然后，我们定义了一个新函数和一些参数，以使用顶点的不同邻居找到两个大图的距离。他们有一些方法集中在图形的其他特征上以获得它们之间的距离，但是其中一些是节点对应关系，这意味着其节点集具有相同的大小。但是，在本文中，我们引入了一种新方法，该方法可以找到两个具有不同大小的节点集的大图之间的距离。
In this paper, we present a new metric distance for comparing two large graphs to find similarities and differences between them based on one of the most important graph structural properties, which is Node Adjacency Information, for all vertices in the graph. Then, we defined a new function and some parameters to find the distance of two large graphs using different neighbors of vertices. There are some methods which they focused on the other features of graphs to obtain the distance between them, but some of them are Node Correspondence which means their node set have the same size. However, in this paper, we introduce a new method which can find the distance between two large graphs with different size of node set.
