scientific article; zbMATH DE number 1054729
From MaRDI portal
Publication:4352274
zbMath0883.05096MaRDI QIDQ4352274
Publication date: 1 March 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
partitionssemidefinite programmingeigenvalueseigenvectorsmax-cut problemrapidly mixing Markov chainsisoperimetric propertiesLaplacean
Programming involving graphs or networks (90C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Spectral properties of token graphs, Unnamed Item, Grid spanners with low forwarding index for energy efficient networks, Semidefinite programming and combinatorial optimization, de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph, Discrete nodal domain theorems, On the restricted numerical range of the Laplacian matrix for digraphs, Complementary eigenvalues of graphs, Graph partitioning by correspondence analysis and taxicab correspondence analysis, A dynamical approach to efficient eigenvalue estimation in general multiagent networks, Laplacian matrix of a weighted graph with new pendant vertices, Graph signal sampling and interpolation based on clusters and averages, iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data, A review on spectral clustering and stochastic block models, Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs, Nonsingular mixed graphs with few eigenvalues greater than two, A Unified Framework for Structured Graph Learning via Spectral Constraints, Entropy and stability of phase synchronisation of oscillators on networks, The Laplacian spread of unicyclic graphs, Disconnecting strongly regular graphs, Organisational hierarchy constructions with easy Kuramoto synchronisation, Spectra of bowtie product of graphs, Spectral Bounds for the k-Regular Induced Subgraph Problem, Upper bounds on algebraic connectivity via convex optimization, Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them, Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size, A discrete Gauss-Green identity for unbounded Laplace operators, and the transience of random walks, Sparse network optimization for synchronization, Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs, Introduction to Complex Networks: Structure and Dynamics, Overview of the topical collection: harmonic analysis on combinatorial graphs, A spectral bound for graph irregularity, Random walks and diffusion on networks, On the Kirchhoff and the Wiener indices of graphs and block decomposition, The extendability of matchings in strongly regular graphs, Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems, Conductance in discrete dynamical systems, Deconstructing the Gel'fand-Yaglom method and vacuum energy from a theory space, Graphs with fourth Laplacian eigenvalue less than two, Spectra of Laplacian Matrices of Weighted Graphs: Structural Genericity Properties, Commute times for a directed graph using an asymmetric Laplacian, Free energy on a cycle graph and trigonometric deformation of heat kernel traces on odd spheres, Conductance, Laplacian and mixing rate in discrete dynamical systems, On the Fiedler value of large planar graphs, Edge-connectivity and (signless) Laplacian eigenvalue of graphs, On spectral integral variations of mixed graphs, On the sign patterns of the smallest signless Laplacian eigenvector, Peer counting and sampling in overlay networks based on random walks, Sharp spectral bounds for the edge-connectivity of regular graphs, Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence, Graphs with small second largest Laplacian eigenvalue, Stochastic (in)stability of synchronisation of oscillators on networks, Laplacian eigenvalues and fixed size multisection, Decentralized observers with consensus filters for distributed discrete-time linear systems, Bipartite graphs with small third Laplacian eigenvalue., On ordering bicyclic graphs with respect to the Laplacian spectral radius, On edge singularity and eigenvectors of mixed graphs, Synchronization in networks of linear agents with output feedbacks, Computing the permanent of the Laplacian matrices of nonbipartite graphs, Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra, Accelerated multigrid for graph Laplacian operators, Max-cut and extendability of matchings in distance-regular graphs, Soft memberships for spectral clustering, with application to permeable language distinction, Several sharp upper bounds for the largest Laplacian eigenvalue of a graph, A survey of automated conjectures in spectral graph theory, Kirchhoff index of graphs and some graph operations, The Laplacian spectrum of a mixed graph, Graphs and Hermitian matrices: eigenvalue interlacing, Largest eigenvalue of a unicyclic mixed graphs, The Laplacian-energy like of graphs, Unnamed Item, Graphs whose normalized Laplacian has three eigenvalues, On the Laplacian spectral radius of bipartite graphs with fixed order and size, On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs, Eigenvalue bounds on restrictions of reversible nearly uncoupled Markov chains, Potential energy principles in networked systems and their connections to optimization problems on graphs, Bounding the gap between extremal Laplacian eigenvalues of graphs, Data-driven surrogates for high dimensional models using Gaussian process regression on the Grassmann manifold, Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum, Upper bound for the Laplacian graph eigenvalues, Non-bipartite graphs with third largest Laplacian eigenvalue less than three, Dominant vertices in regulatory networks dynamics, The toughness of Kneser graphs, Algebraic connectivity and doubly stochastic tree matrices, Some notes on the spectral perturbations of the signless Laplacian of a graph, On eigenvectors of mixed graphs with exactly one nonsingular cycle, Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products, The Laplacian spectral radius of graphs, Exponential Random Graphs as Models of Overlay Networks, Spectral threshold for extremal cyclic edge-connectivity, The Laplacian spectral radius of some graphs, The Laplacian spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendant vertices, Laplacian eigenvalues and partition problems in hypergraphs, First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph, Fast algorithms for fair dynamic load redistribution in heterogeneous environments, Group synchronization on grids, Spectra of signed graphs, Eigenvalues and edge-connectivity of regular graphs, Lower bounds for the eigenvalues of Laplacian matrices, Scale-space module detection for random fields observed on a graph non-embedded in a metric space, Bounds for the least Laplacian eigenvalue of a signed graph, Spatial design matrices and associated quadratic forms: structure and properties, Landscapes on spaces of trees, Sampling by Averages and Average Splines on Dirichlet Spaces and on Combinatorial Graphs, The Laplacian eigenvalues of mixed graphs, Spectra of M-rooted product of graphs, On Cheeger-type inequalities for weighted graphs
