Merris, The Laplacian spectrum of a graph, SIAM J. Discrete Math. 7 (1994) 221-229.Das, K.C.: The Laplacian spectrum of a graph. Comput. Math. Appl. 48 , 715–724 (2004) MathSciNet MATHK. C. Das : The Laplacian spectrum of a graph. Comput. Math. Appl. 48 (2004), 715–...
Merris The Laplacian spectrum of a graph II SIAM J. Discrete Math., 7 (1994), pp. 221-229 Google Scholar [17] I. Gutman The energy of a graph: old and new results A. Betten, A. Kohnert, R. Laue, A. Wassermann (Eds.), Algebraic Combinatorics and Applications, Springer-Verlag, ...
Alon [A2] and Alon and Milman [AM1, AM2] followed Tanner’s approach, but later they realized [A1, AM3, AGM] that the Laplacian spectrum of a graph (in particular the second smallest eigenvalue) appears more naturally in the study of expanding properties of graphs. [Ro] is an overview...
Tyrus Berry, Steven Heilman, and Robert S. Strichartz, Outer Approximation of the Spectrum of a Fractal Laplacian, Experimental Mathematics, 18, no. 4 (2009) 449-480Berry T, Heilman S, Strichartz RS. Outer Approximation of the Spectum of a Fractal Laplacian. Exp Math. 2009;18(4):449–...
Bounds of the Laplacian spectral radius of a graph 来自 Semantic Scholar 喜欢 0 阅读量: 16 作者: C Wang 摘要: An inequality on eigenvalues is presented.We apply it to estimate the eigenvalues of the Laplacian matrix L(G)of a graph G=(V,E).关键词:...
At a high level, the so-called Laplacian spectrum (i.e., eigenvalues) of a graph, along with associated eigenvectors, captures important information regarding it (e.g., number of spanning trees, algebraic connectivity, and numerous related properties78). Reprojecting the response graph by using...
In spectral graph theory, the (adjacency) spectrum of a graph, which is the spectrum of its adjacency matrix, is one of its topologi- cal invariants16. Thus, the spectrum of Af(e) can be used to describe the grain topology. The Laplacian matrix of a graph is defined as the degree ...
B. Mohar, The Laplacian spectrum of graphs, in Graph Theory, Combinatorics, and Applications, ed. by Y. Alavi, G. Chartrand, O.R. Oellermann, A.J. Schwenk, vol. 2 (Wiley, 1991), pp. 871–898 Google Scholar E.H. Moore, General Analysis. Memoirs of the American Philosophical Societ...
5 for operators of the form (4) (we actually allow V to be a pseudodifferential operator). Our counterexamples show that these upper bounds are sharp. To simplify the exposition we state the result for the fractional Laplacian H0=(−Δ)s. We remark that part (i) of the following ...
Merris The Laplacian spectrum of a graph II SIAM J. Discrete Math., 7 (1994), pp. 221-229 Google Scholar [14] I. Gutman The energy of a graph: old and new results A. Betten, A. Kohnert, R. Laue, A. Wassermann (Eds.), Algebraic Combinatorics and Applications, Springer-Verlag, ...