Results 111 to 120 of about 13,572 (222)

The Laplacian Spread of a Tree

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
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

open access: green, 1984
O. Bohigas, M.J. Giannoni, C. Schmit
openalex   +2 more sources

Maximizing the smallest eigenvalue of grounded Laplacian matrix

open access: yesJournal of Global Optimization
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

Learning Laplacian Matrix from Graph Signals with Sparse Spectral Representation

open access: green, 2021
Pierre Humbert   +4 more
openalex   +1 more source

Home - About - Disclaimer - Privacy