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)的距离正则图 相关短句/例句 dist...
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)的距离正则图...
On Laplacian eigenvalues of connected graphs Article 25 June 2015 References Aouchiche, M., Hansen, P.: Distance spectra of graphs: a survey. Linear Algebra Appl. 458, 301–386 (2014) Article MathSciNet MATH Google Scholar Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New Yo...
Let ∂1≥∂2≥⋯≥∂n−1≥∂n be the distance spectra of G. The distance energy of a connected graph G was defined in [20] as DE=DE(G)=∑i=1n|∂i|.Its mathematical properties were extensively investigated, see the recent articles [[4], [20], [26], [27], [32]]...
Spectra of graphs obtained by a generalization of the join graph operation Linear Algebra Appl., 313 (2013), pp. 733-741 View PDFView articleView in ScopusGoogle Scholar [5] D. Cvetković, P. Rowlinson, S. Simić An Introduction to the Theory of Graph Spectra (first ed.), Cambridge ...
The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. graph distance polynomial barbell graph (1+x)^(2n-4)(n+2nx+x^2)[(2+x)^2-n(5+4x)]
In particular, we determine all graphs whose distance matrices have exactly two eigenvalues (counting multiplicity) different from -1 and -3. 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 ...
Distance-time graphs show how far an object has travelled in a designated period of time. The graph shows distance versus time and is made up of a simple line graph. 1.On the Y-axis, the distance is plotted. 2.On the X-axis, time is plotted. ...
The following theorems give D-spectra of graphs constructed by above mentioned definitions. Theorem 1 [17] For i=1,2, let Gi be an ri-regular graph with ni vertices and the eigenvalues λi,1=ri≥⋯≥λi,ni of the adjacency matrix of Gi . The distance spectrum of G1∇G2 consi...