Combinatorial Fiedler theory and graph partition

DOI10.1016/j.laa.2024.02.005arXiv2306.13032MaRDI QIDQ6118786

Geir Dahl, Enide Andrade

Publication date: 28 February 2024

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2306.13032

zbMATH Keywords

algebraic connectivitygraph partition\(\ell_1\)-normsparsest cutgraph smoothing problem

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)

Cites Work

• The complexity of finding uniform sparsest cuts in various graph classes
• Graph clustering
• Laplace eigenvalues of graphs---a survey
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Eigenvalues and expanders
• Optimal linear labelings and eigenvalues of graphs
• On graphs with algebraic connectivity equal to minimum edge density
• Combinatorial Perron parameters for trees
• Graphs, partitions and Fibonacci numbers
• Complementary pivot theory of mathematical programming
• Isoperimetric numbers of graphs
• $O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
• On the maximal error of spectral approximation of graph bisection
• Expander graphs and their applications
• Image Decomposition and Restoration Using Total Variation Minimization and theH¹
• Combinatorial Perron values of trees and bottleneck matrices
• Fiedler vectors with unbalanced sign patterns
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial Fiedler theory and graph partition