Graph partitioning by eigenvectors
From MaRDI portal
Given a graph G on n vertices and \(z\in R^ n\), we say that a vertex of G is positive, nonnegative, null, etc. if the corresponding entry of z has that property. For z such that Az\(\geq \alpha z\) (A is the adjacency matrix of G) the number of components of the subgraph induced by positive vertices is bounded. Inequalities for several related quantities are derived provided z is an eigenvector. The paper reflects a recent trend in the theory of graph spectra: studying eigenspaces of graphs.
Recommendations
Cites work
- Graph Coloring Using Eigenvalue Decomposition
- 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?)
Cited in
(38)- Spectral partitioning with multiple eigenvectors
- Bounds of eigenvalues of graphs
- Null decomposition of trees
- Some new bounds on the spectral radius of graphs
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
- Graph Laplacians, nodal domains, and hyperplane arrangements
- Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs
- Exploring the heterogeneity for node importance byvon Neumann entropy
- Null decomposition of unicyclic graphs
- \(\lambda\)-core distance partitions
- Characterizing identifying codes from the spectrum of a graph or digraph
- Topological melting in networks of granular materials
- Spectral bisection of graphs and connectedness
- Generalized modularity matrices
- Factorization-Based Graph Repartitionings
- scientific article; zbMATH DE number 2127748 (Why is no real title available?)
- On the maximal error of spectral approximation of graph bisection
- Rugged and elementary landscapes
- scientific article; zbMATH DE number 4063270 (Why is no real title available?)
- Sharp upper bounds on the second largest eigenvalues of connected graphs
- Spectra of Laplacian matrices of weighted graphs: structural genericity properties
- Bounds on the subdominant eigenvalue involving group inverse with applications to graphs
- Bounds for Kirchhoff index and Laplacian-energy-like invariant of some derived graphs of a regular graph
- A new matrix representation of multidigraphs
- Some spectral properties of \(A_\alpha\)-matrix
- Minimum supports of eigenfunctions of graphs: a survey
- Discrete nodal domain theorems
- Symmetric matrices, signed graphs, and nodal domain theorems
- Nodal domain theorems for p-Laplacians on signed graphs
- Ordering unicyclic graphs in terms of their smaller least eigenvalues
- A note on edge-based graph partitioning and its linear algebraic structure
- Qualitative, statistical, and extreme properties of spectral indices of signable pseudo-invertible graphs
- Laplace eigenvalues of graphs---a survey
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- On the second largest adjacency eigenvalue of trees with given diameter
- On the two largest Q-eigenvalues of graphs
- Bounds on graph eigenvalues
- Tree decomposition by eigenvectors
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)
