Paul, On the distance Laplacian spectra of graphs, Linear Algebra Appl. 460 (2014), 97-110.Milan Nath and Somnath Paul, On the distance Laplacian spectra of graphs, Linear Algebra Appl. 460 (2014), 97-110.Nath M
Paul, On the distance Laplacian spectra of graphs, Linear Algebra Appl. 460 (2014) 97-110. Article MathSciNet MATH Google Scholar C. M. Da Silva, M.A.A. De Freitas, R.R. Del-Vecchio, (2016) A note on a conjecture for the distance Laplacian matrix, Electron. J. Linear Algebra ...
There has also been extensive work on distance spectra (eigenvalues of distance matrices); see [3] for a recent survey. In [20], the authors classify the distance regular graphs having exactly one positive distance eigenvalue. Such graphs are directly related to a metric hierarchy for finite ...
Moreover, we prove that one class of unicyclic graphs are determined by their signless Laplacian spectra.doi:10.5402/2011/282940Mu-Huo LiuInternational Scholarly Research NetworkIsrn AlgebraM. H. Liu. Some results on the signless Laplacian spectra of unicyclic graphs. International Scholarly Research...
Combinatorial upper bounds for the smallest eigenvalue of a graph Article 14 May 2024 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...
在定义signal/functionf后,从节点i到变化到节点j产生的信息增益就是f_i-f_j,再加上边的权重w_{i,j},就回到了paper中的公式。 The graph Laplacian is a difference operator(微分算子), as, for any signalf\in \mathbb{R}^N (\Delta f)(i)=\sum_{j\in \mathcal{N}_i} W_{i,j}[f(i)-...
through the Laplacian quadratic form,二次型的计算:0.14,1.31,1.81 没整明白这咋算的 谱域表示中,也就是下面的三个图里,\mathcal{G}_1中\hat{\mathbf{f}}最大的energy在最低的频率(第一根线);\mathcal{G}_3中大的值分布在更高的频率里。
In particular, we uncover a class of smooth distances on a surface transitioning from a purely spectral distance to the geodesic distance between points; these distances also can be extended to the volume inside and outside the surface. A number of additional applications of our machinery to ...
The complete graph and the star give the smallest distance signless Laplacian energy DSLE among all the graphs and trees of order n, respectively. We give lower bounds on distance Laplacian energy DLE in terms of n for graphs and trees, and characterize the extremal graphs. Also we obtain ...
On the A α -spectra of graphsdoi:10.1016/j.laa.2018.07.003Huiqiu Lin aJie Xue bJinlong Shu bLinear Algebra and its Applications