Spectra and optimal partitions of weighted graphs

DOI10.1016/0012-365X(94)90100-7MaRDI QIDQ1322166zbMATH OpenOpenAlexFDO

Authors Marianna Bolla, Gábor Tusnády

Publication date 15 September 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(94)90100-7

zbMATH Keywords

eigenvalueseigenvectorsLaplacianspectrumweighted graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Algorithms for graph partitioning problems by means of eigenspace relaxations
• Spectra, Euclidean representations and clusterings of hypergraphs
• A computational study of graph partitioning
• Spectra and structure of weighted graphs

Cites work

• scientific article; zbMATH DE number 3885945 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• scientific article; zbMATH DE number 3349875 (Why is no real title available?)
• A new 5‐arc‐transitive cubic graph
• Eigenvalues and expanders
• Separation theorems for singular values of matrices and their applications in multivariate analysis
• Some Recent Investigations of a New Fuzzy Partitioning Algorithm and its Application to Pattern Classification Problems
• Spectra, Euclidean representations and clusterings of hypergraphs
• Well-Separated Clusters and Optimal Fuzzy Partitions

Cited in

(26)

• Isoperimetric properties of weighted graphs related to the Laplacian spectrum and canonical correlations
• Spectra, Euclidean representations and clusterings of hypergraphs
• Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
• SVD, discrepancy, and regular structure of contingency tables
• Distribution of the eigenvalues of random block-matrices.
• Beyond the expanders
• Optimization problems for weighted graphs and related correlation estimates
• Spectra and structure of weighted graphs
• Noisy random graphs and their laplacians
• Recognizing linear structure in noisy matrices
• Graph-Based Representations in Pattern Recognition
• Bipartition of graphs based on the normalized cut and spectral methods. I: Minimum normalized cut
• A theory of spectral partitions of metric graphs
• Network partition via a bound of the spectral radius
• Regularity-based spectral clustering and mapping the Fiedler-carpet
• Laplacian eigenvalues and fixed size multisection
• Weighted Laplacians and the sigma function of a graph
• Testing goodness of fit of random graph models
• Minimal Dirichlet energy partitions for graphs
• Modeling graphs using dot product representations
• Modularity spectra, eigen-subspaces, and structure of weighted graphs
• On minimizing the spectral width of graph Laplacians and associated graph realizations
• A general method to obtain the spectrum and local spectra of a graph from its regular partitions
• Combinatorial algorithms for minimizing the maximum Laplacian and signless Laplacian eigenvalues of weighted graphs
• The Cheeger cut and Cheeger problem in metric graphs
• scientific article; zbMATH DE number 2154974 (Why is no real title available?)

This page was built for publication: Spectra and optimal partitions of weighted graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322166)