Results 111 to 120 of about 13,572 (222)
Asymptotic evaluation of a lattice sum associated with the Laplacian matrix
Arzu Boysal +2 more
openalex +2 more sources
The Laplacian Spread of a Tree
The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph.
Yi-Zheng Fan +3 more
doaj
Spectral properties of the Laplacian and random matrix theories
O. Bohigas, M.J. Giannoni, C. Schmit
openalex +2 more sources
Order unicyclic graphs according to spetral radius of unoriented Laplacian matrix
Yi-Zheng Fan, Wu Song
openalex +2 more sources
Maximizing the smallest eigenvalue of grounded Laplacian matrix
For a connected graph $\mathcal{G}=(V,E)$ with $n$ nodes, $m$ edges, and Laplacian matrix $\boldsymbol{\mathit{L}}$, a grounded Laplacian matrix $\boldsymbol{\mathit{L}}(S)$ of $\mathcal{G}$ is a $(n-k) \times (n-k)$ principal submatrix of $\boldsymbol{\mathit{L}}$, obtained from $\boldsymbol{\mathit{L}}$ by deleting $k$ rows and columns corresponding ...
Xiaotian Zhou +3 more
openaire +2 more sources
The tau constant and the discrete Laplacian matrix of a metrized graph
Zübeyir Çınkır
openalex +2 more sources
Constructions for cospectral graphs for the normalized Laplacian matrix and distance matrix
Kristin Heysse
openalex +2 more sources
Learning Laplacian Matrix from Graph Signals with Sparse Spectral Representation
Pierre Humbert +4 more
openalex +1 more source
New methods for maximizing the smallest eigenvalue of the grounded Laplacian matrix [PDF]
Ahmad Anaqreh +2 more
openalex +1 more source

