List questions from spectral-graph-theory

Published on 22 Apr 2013 - 11:34

61

Views

For which spectrum is the following result for?

Published on 23 Apr 2013 - 13:16

146

Views

when does a graph with normalized laplacian have a uniform degree distribution?

Published on 08 May 2013 - 17:07

257

Views

Upper bound on the difference between two elements of an eigenvector

Published on 22 May 2013 - 21:28

107

Views

Algebraic characterization of being $P_n$-free.

Published on 02 Jul 2013 - 11:25

392

Views

Connection between the Tutte and characteristic polynomials?

Published on 24 Feb 2026 - 3:27

522

Views

What does small eigenvalue gap imply for a graph?

Published on 21 Aug 2013 - 19:33

353

Views

Variance of the first return time of a simple random walk on an hypercube graph

Published on 22 Aug 2013 - 21:03

526

Views

cluster validation and determining number of clusters

Published on 26 Aug 2013 - 6:39

1.1k

Views

What can we say about two graphs if they have similar adjacency matrices?

Published on 25 Mar 2026 - 14:34

382

Views

Is the upper Cheeger Inequality tight?

Published on 20 Sep 2013 - 1:00

464

Views

Constructing a directed graph from its spectrum

Published on 28 Oct 2013 - 15:03

754

Views

Are these equivalent representations (labelled graph and adjacency matrix)?

Published on 28 Oct 2013 - 21:26

6.7k

Views

Rank of adjacency matrix vs rank of graph Laplacian

Published on 25 Mar 2026 - 22:06

1.6k

Views

how do I compute the eigenvectors for spectral clustering from a singular value decomposition?

Published on 19 Nov 2013 - 23:07

List Question

Bounds on the maximum eigenvalue of the adjacency matrix of a graph.

For which spectrum is the following result for?

when does a graph with normalized laplacian have a uniform degree distribution?

Upper bound on the difference between two elements of an eigenvector

Algebraic characterization of being $P_n$-free.

Connection between the Tutte and characteristic polynomials?

What does small eigenvalue gap imply for a graph?

Variance of the first return time of a simple random walk on an hypercube graph

cluster validation and determining number of clusters

What can we say about two graphs if they have similar adjacency matrices?

Is the upper Cheeger Inequality tight?

Constructing a directed graph from its spectrum

Are these equivalent representations (labelled graph and adjacency matrix)?

Rank of adjacency matrix vs rank of graph Laplacian

how do I compute the eigenvectors for spectral clustering from a singular value decomposition?

Trending Questions

Popular # Hahtags

Popular Questions