Isoperimetric numbers of graphs
From MaRDI portal
Publication:2639872
DOI10.1016/0095-8956(89)90029-4zbMath0719.05042OpenAlexW2027199101WikidataQ56689033 ScholiaQ56689033MaRDI QIDQ2639872
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(89)90029-4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge disjoint placement of graphs
- On the bipartition of graphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Note on the girth of Ramanujan graphs
- Isoperimetric inequalities and Markov chains
- Isoperimetric inequalities, growth, and the spectrum of graphs
- Ramanujan graphs
- Eigenvalues and expanders
- Some simplified NP-complete graph problems
- Cubic graphs and the first eigenvalue of a Riemann surface
- Subgraphs of graphs. I
- The Spectral Radius of infinite Graphs
- Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
Related Items (only showing first 100 items - show all)
On the cop number of graphs of high girth ⋮ Combinatorial Fiedler theory and graph partition ⋮ On the eigenvalues of the graphs \(D(5,q)\) ⋮ Unnamed Item ⋮ Normalized Laplacian eigenvalues of hypergraphs ⋮ Robust network formation with biological applications ⋮ Bounds for isoperimetric constants of infinite plane graphs ⋮ Perfect matching in random graphs is as hard as Tseitin ⋮ A survey of the modified Moran process and evolutionary graph theory ⋮ Spectral properties of unimodular lattice triangulations ⋮ Spectral estimates for infinite quantum graphs ⋮ Eigenvalues of Cayley graphs ⋮ From graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data clouds ⋮ Unnamed Item ⋮ An estimate for the nonstochastic eigenvalues of doubly stochastic matrices ⋮ On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs ⋮ Laplacian spectral bounds for clique and independence numbers of graphs ⋮ Computing the isoperimetric number of a graph ⋮ Network synchronization: Spectral versus statistical properties ⋮ Fractal graphs by iterated substitution ⋮ Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow ⋮ Spectra of the neighbourhood corona of two graphs ⋮ On the algebraic connectivity of graphs as a function of genus ⋮ An upper bound on the algebraic connectivity of outerplanar graphs ⋮ Spectral partitioning works: planar graphs and finite element meshes ⋮ New spectral lower bounds on the bisection width of graphs ⋮ The spectrum of Platonic graphs over finite fields ⋮ A new upper bound for the isoperimetric number of de Bruijn networks ⋮ Spectral bounds for the betweenness of a graph ⋮ Shadows under the word-subword relation ⋮ Isoperimetric numbers of graph bundles ⋮ Robustness of random graphs based on graph spectra ⋮ Cheeger constants of arithmetic hyperbolic 3-manifolds ⋮ Eigenvalues of Graphs and Sobolev Inequalities ⋮ Data Analytics on Graphs Part I: Graphs and Spectra on Graphs ⋮ The influence of Miroslav Fiedler on spectral graph theory ⋮ Mean isoperimetry with control on outliers: exact and approximation algorithms ⋮ Ricci curvature of Bruhat orders ⋮ Tighter spectral bounds for the cut size, based on Laplacian eigenvectors ⋮ A Cheeger-type inequality on simplicial complexes ⋮ EFFECTS OF DEGREE CORRELATION ON THE SYNCHRONIZATION OF NETWORKS OF OSCILLATORS ⋮ Design of highly synchronizable and robust networks ⋮ Clustering and outlier detection using isoperimetric number of trees ⋮ On Cheeger inequalities of a graph ⋮ On Canonical Concurrent Flows, Crossing Number and Graph Expansion ⋮ Spectral analysis of non-Hermitian matrices and directed graphs ⋮ The minimum size of graphs satisfying cut conditions ⋮ Combinatorial Perron values of trees and bottleneck matrices ⋮ Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae ⋮ Large scale Ricci curvature on graphs ⋮ Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic systems ⋮ Edge-connectivity and (signless) Laplacian eigenvalue of graphs ⋮ Lower bounds for the Estrada index using mixing time and Laplacian spectrum ⋮ Strong Isoperimetric Inequality for Tessellating Quantum Graphs ⋮ An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs ⋮ Analytic connectivity of k-uniform hypergraphs ⋮ Multi-way sparsest cut problem on trees with a control on the number of parts and outliers ⋮ Cheeger constants of Platonic graphs. ⋮ The bisection width and the isoperimetric number of arrays. ⋮ Vulnerability of nearest neighbor graphs ⋮ Lexicographic product and isoperimetric number ⋮ Multi-way dual Cheeger constants and spectral bounds of graphs ⋮ Eigenvalues, diameter, and mean distance in graphs ⋮ Generalized \(\Gamma\) calculus and application to interacting particles on a graph ⋮ On the spectrum of hypergraphs ⋮ Spectral and combinatorial properties of some algebraically defined graphs ⋮ Synchronization in power-law networks ⋮ On the Structure of Isometrically Embeddable Metric Spaces ⋮ Measuring the impact of MVC attack in large complex networks ⋮ A domain monotonicity theorem for graphs and Hamiltonicity ⋮ Laplace eigenvalues of graphs---a survey ⋮ Eigenvalue bounds for the signless \(p\)-Laplacian ⋮ Synchronization in random networks with given expected degree sequences ⋮ Une variante de l'inégalité de Cheeger pour les chaînes de Markov finies ⋮ The second eigenvalue of some normal Cayley graphs of highly transitive groups ⋮ Edge separators for graphs of bounded genus with applications ⋮ Partitioning a graph into defensive \(k\)-alliances ⋮ On the isoperimetric spectrum of graphs and its approximations ⋮ Network robustness to targeted attacks. The interplay of expansibility and degree distribution ⋮ Unnamed Item ⋮ Ricci curvature, graphs and eigenvalues ⋮ Cheeger constants, structural balance, and spectral clustering analysis for signed graphs ⋮ Gonality of expander graphs ⋮ Maximum rooted connected expansion ⋮ Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence ⋮ Expanding and forwarding ⋮ Gluing of graph Laplacians and their spectra ⋮ Absorption time of the Moran process ⋮ Laplacian eigenvalues and partition problems in hypergraphs ⋮ On the weak distance-regularity of Moore-type digraphs ⋮ Cut ratios and Laplacian eigenvalues ⋮ Perron value and moment of rooted trees ⋮ Clustering based on eigenvectors of the adjacency matrix ⋮ On the complexity of isoperimetric problems on trees ⋮ Unnamed Item ⋮ Robustness of regular ring lattices based on natural connectivity ⋮ On the isoperimetric number of a \(k\)-degree Cayley graph ⋮ Unnamed Item ⋮ Rapid Mixing and Markov Bases ⋮ Optimization problems for weighted graphs and related correlation estimates
This page was built for publication: Isoperimetric numbers of graphs
