Graph partitioning by eigenvectors
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4063270 (Why is no real title available?)
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3377258 (Why is no real title available?)
- scientific article; zbMATH DE number 3394189 (Why is no real title available?)
- Graph Coloring Using Eigenvalue Decomposition
Cited in
(37)- Discrete nodal domain theorems
- Nodal domain theorems for \(p\)-Laplacians on signed graphs
- Null decomposition of unicyclic graphs
- On the maximal error of spectral approximation of graph bisection
- Tree decomposition by eigenvectors
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
- Topological melting in networks of granular materials
- scientific article; zbMATH DE number 4063270 (Why is no real title available?)
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Some spectral properties of \(A_\alpha\)-matrix
- Factorization-Based Graph Repartitionings
- Generalized modularity matrices
- Ordering unicyclic graphs in terms of their smaller least eigenvalues
- Bounds for Kirchhoff index and Laplacian-energy-like invariant of some derived graphs of a regular graph
- Null decomposition of trees
- Sharp upper bounds on the second largest eigenvalues of connected graphs
- Spectral partitioning with multiple eigenvectors
- \(\lambda\)-core distance partitions
- Spectra of Laplacian matrices of weighted graphs: structural genericity properties
- Some new bounds on the spectral radius of graphs
- scientific article; zbMATH DE number 2127748 (Why is no real title available?)
- Exploring the heterogeneity for node importance byvon Neumann entropy
- Rugged and elementary landscapes
- On the two largest \(Q\)-eigenvalues of graphs
- Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs
- Spectral bisection of graphs and connectedness
- Minimum supports of eigenfunctions of graphs: a survey
- Characterizing identifying codes from the spectrum of a graph or digraph
- Bounds on graph eigenvalues
- Symmetric matrices, signed graphs, and nodal domain theorems
- A note on edge-based graph partitioning and its linear algebraic structure
- Laplace eigenvalues of graphs---a survey
- Graph Laplacians, nodal domains, and hyperplane arrangements
- Bounds of eigenvalues of graphs
- Bounds on the subdominant eigenvalue involving group inverse with applications to graphs
- Qualitative, statistical, and extreme properties of spectral indices of signable pseudo-invertible graphs
- A new matrix representation of multidigraphs
This page was built for publication: Graph partitioning by eigenvectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1116959)