Computer generation of distance polynomials of graphs
Computer generation of distance polynomials of graphs
复制标题
DOI：
10.1002/jcc.540110706
复制
发表时间：
1990-08
影响因子：
3
通讯作者：
K. Balasubramanian
中科院分区：
文献类型：
--
作者：
K. Balasubramanian
开发了一个计算最多200个顶点的图的距离多项式的计算机程序。该代码还计算距离矩阵的特征值和特征向量。它只需要输入程序用来构造距离矩阵的邻域信息。特征值和特征向量使用Given-Householder方法计算，而距离矩阵的特征多项式使用作者以前开发的代码构造。新开发的代码进行了测试，在许多图形包含大量的顶点。它表明，一些循环等谱图的区别，其距离多项式，虽然距离多项式本身一般不是唯一的结构不变量。
A computer program is developed to compute distance polynomials of graphs containing up to 200 vertices. The code also computes the eigenvalues and the eigenvectors of the distance matrix. It requires as input only the neighborhood information from which the program constructs the distance matrix. The eigenvalues and eigenvectors are computed using the Givens‐Householder method while the characteristic polynomials of the distance matrix are constructed using the codes developed by the author before. The newly developed codes are tested out on many graphs containing large numbers of vertices. It is shown that some cyclic isospectral graphs are differentiated by their distance polynomials although distance polynomials themselves are in general not unique structural invariants.