List questions from spectral-graph-theory

Published on 13 May 2015 - 15:57

554

Views

spectrum of complete p-partite graphs

Published on 14 May 2015 - 10:29

128

Views

When do a Regular graph has an odd eigenvalue?

Published on 20 May 2015 - 7:41

542

Views

Construction of graph Laplacian

Published on 25 Mar 2026 - 17:38

41

Views

How networks with high largest eigenvalues are more robust?

Published on 26 Mar 2026 - 10:56

46

Views

What do we know about inverses of matrices which are "like" Laplacians of graphs?

Published on 16 Jun 2015 - 22:07

92

Views

Relation between edge expansion of graph and sparsity

Published on 23 Jun 2015 - 12:29

2k

Views

What can we say about the graph when many eigenvalues of the Laplacian are equal to 1?

Published on 25 Mar 2026 - 19:10

92

Views

How to perturb an adjacency matrix in order to have the highest increase in spectral radius?

Published on 08 Jul 2015 - 16:58

35

Views

Size of intersection of balls on non-ameanable graphs

Published on 09 Jul 2015 - 17:33

138

Views

Highest eigenvalues/vectors of graph laplacian

Published on 25 Mar 2026 - 15:58

1k

Views

Characteristic polynomial of a block matrix

Published on 18 Jul 2015 - 6:13

656

Views

Confusion between spectral radius of matrix and spectral radius of the operator

Published on 25 Mar 2026 - 6:06

430

Views

Eigenvalue of Block matrix: Adjacency of complete bipartite Graph

Published on 31 Jul 2015 - 19:28

1.8k

Views

Computing eigenvalue of the adjacency matrix of a path

Published on 25 Mar 2026 - 19:02

List Question

Interpretations of a weighted adjacency matrix's eigenvectors and eigenvalues?

spectrum of complete p-partite graphs

When do a Regular graph has an odd eigenvalue?

Construction of graph Laplacian

How networks with high largest eigenvalues are more robust?

What do we know about inverses of matrices which are "like" Laplacians of graphs?

Relation between edge expansion of graph and sparsity

What can we say about the graph when many eigenvalues of the Laplacian are equal to 1?

How to perturb an adjacency matrix in order to have the highest increase in spectral radius?

Size of intersection of balls on non-ameanable graphs

Highest eigenvalues/vectors of graph laplacian

Characteristic polynomial of a block matrix

Confusion between spectral radius of matrix and spectral radius of the operator

Eigenvalue of Block matrix: Adjacency of complete bipartite Graph

Computing eigenvalue of the adjacency matrix of a path

Trending Questions

Popular # Hahtags

Popular Questions