distance matrixConnected graphSpectraLet G = (V, E) be a connected graph with vertex set V(G) = {v(1), v(2), ... , v(n)} and edge set E(G). Let D(G) be the distance matrix of G and lambda(1)(D) >= ... >= lambda(n)(D) be its distance spectrum. The distance ...
Let D(G) be the distance matrix of G and be its distance spectrum. The distance between distance spectra of G and is defined by Define the cospectrality of G by Let . In the paper, we obtain lower bounds on and for . Furthermore, we give an upper bound on ....
16. Clustering Algorithm Based on Normalized Edit Distance of Graph Spectra; 基于图谱归一化编辑距离的聚类算法 17. On the thin weakly distance-regular Carley digraphs; 一些非弱距离正则的Cayley有向图 18. Distance-regular Graph with a_(r+1)=t(s-1); a_(r+1)=t(s-1)的距离正则图©...
In practice, exact computation of the edit distance between model signature graphs is believed to be an NP-hard problem. We show that properties of the design signature graph's spectra, derived from the eigenvalues of its adjacency ... D Mcwherter,M Peabody,WC Regli,... 被引量: 96发表:...
Hypercubes are determined by their distance spectraHypercubes are determined by their distance spectraCospectral graphsHypercubesDistance spectrumIsometric embeddingDistance matrixWe show that the d-cube is determined by the spectrum of its distance matrix.doi...
16.Clustering Algorithm Based on Normalized Edit Distance of Graph Spectra;基于图谱归一化编辑距离的聚类算法 17.On the thin weakly distance-regular Carley digraphs;一些非弱距离正则的Cayley有向图 18.Distance-regular Graph with a_(r+1)=t(s-1);a_(r+1)=t(s-1)的距离正则图 相关短句/例句 dist...
It turns out that such graphs consist of three infinite classes, and all of them are determined by their distance spectra. We also show that the friendship graph is determined by its distance spectrum.Lu LuCollege of Mathematics and Systems ScienceQiongxiang Huang...
Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity for not necessarily regular graphs, the notion of completely regular code.Up to now, most of the characterizations ofpseudo-distance-regularity has been der... MN Fiol,J Fàbrega,V Diego - Univ...
In this thesis,we consider the extremal graphs about Laplacian spectral radius of bipartite graphs with k cut edges,bicyclic bipartite graphs,unicyclic graphs with fixed diameters,unicyclic graphs with k pendent edges;some graphs determined by their spectra;cospectral graphs;minimal distance spectral radiu...
Reciprocal complementary distance spectra and reciprocal complementary distance energy of line graphs of regular graphs 来自 学术范 喜欢 0 阅读量: 32 作者:HS Ramane,KC Nandeesh 摘要: The complementary distance (CD) matrix of a graph G is defined as CD(G) = [cij ], where cij = 1 + D ...