scientific article; zbMATH DE number 1054729
From MaRDI portal
Publication:4352274
Recommendations
Cited in
(only showing first 100 items - show all)- Dominant vertices in regulatory networks dynamics
- Algebraic connectivity and doubly stochastic tree matrices
- 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
- Eigenvalues and edge-connectivity of regular graphs
- Graph partitioning by eigenvectors
- Some geometric aspects of graphs and their eigenfunctions
- Graphs with fourth Laplacian eigenvalue less than two
- On spectral integral variations of mixed graphs
- Laplacian eigenvalues and fixed size multisection
- Bipartite graphs with small third Laplacian eigenvalue.
- Lower bounds for the eigenvalues of Laplacian matrices
- iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data
- Random walks and diffusion on networks
- Graphs and Hermitian matrices: eigenvalue interlacing
- Largest eigenvalue of a unicyclic mixed graphs
- Eigenvalue bounds on restrictions of reversible nearly uncoupled Markov chains
- Upper bound for the Laplacian graph eigenvalues
- Fast algorithms for fair dynamic load redistribution in heterogeneous environments
- Landscapes on spaces of trees
- The Laplacian eigenvalues of mixed graphs
- Peer counting and sampling in overlay networks based on random walks
- Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence
- On the Laplacian spectral radius of bipartite graphs with fixed order and size
- Potential energy principles in networked systems and their connections to optimization problems on 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
- The toughness of Kneser graphs
- Spectral threshold for extremal cyclic edge-connectivity
- Spectra of signed graphs
- A dynamical approach to efficient eigenvalue estimation in general multiagent networks
- A review on spectral clustering and stochastic block models
- Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
- Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs
- Computing the permanent of the Laplacian matrices of nonbipartite graphs
- Kirchhoff index of graphs and some graph operations
- Cut ratios and Laplacian eigenvalues
- Group synchronization on grids
- Scale-space module detection for random fields observed on a graph non-embedded in a metric space
- Complementary eigenvalues of graphs
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
- Nonsingular mixed graphs with few eigenvalues greater than two
- Deconstructing the Gel'fand-Yaglom method and vacuum energy from a theory space
- Commute times for a directed graph using an asymmetric Laplacian
- 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 the sign patterns of the smallest signless Laplacian eigenvector
- Graphs with small second largest Laplacian eigenvalue
- Stochastic (in)stability of synchronisation of oscillators on networks
- Several sharp upper bounds for the largest Laplacian eigenvalue of a graph
- Bounding the gap between extremal Laplacian eigenvalues of graphs
- Non-bipartite graphs with third largest Laplacian eigenvalue less than three
- Some notes on the spectral perturbations of the signless Laplacian of a graph
- Bounds for the least Laplacian eigenvalue of a signed graph
- Spatial design matrices and associated quadratic forms: structure and properties
- Disconnecting strongly regular graphs
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Sparse network optimization for synchronization
- Overview of the topical collection: harmonic analysis on combinatorial graphs
- Graph partitioning by correspondence analysis and taxicab correspondence analysis
- Sharp spectral bounds for the edge-connectivity of regular graphs
- Laplacian eigenvalues and multisections
- Largest eigenvalue of the Laplacian matrix: its eigenspace and transitive orientations
- Laplacian matrix of a weighted graph with new pendant vertices
- On the Fiedler value of large planar graphs (extended abstract)
- Structural vulnerability and robustness in complex networks: different approaches and relationships between them
- Introduction to complex networks: structure and dynamics
- A spectral bound for graph irregularity.
- Entropy and stability of phase synchronisation of oscillators on networks
- Some applications of eigenvalues of graphs
- The Laplacian spectral radius of graphs
- On Cheeger-type inequalities for weighted graphs
- On eigenvectors of mixed graphs with exactly one nonsingular cycle
- Exponential Random Graphs as Models of Overlay Networks
- A discrete Gauss-Green identity for unbounded Laplace operators, and the transience of random walks
- On the Kirchhoff and the Wiener indices of graphs and block decomposition
- The extendability of matchings in strongly regular graphs
- Laplace eigenvalues and bandwidth‐type invariants of graphs
- scientific article; zbMATH DE number 510844 (Why is no real title available?)
- scientific article; zbMATH DE number 719918 (Why is no real title available?)
- Spectral Bounds for the k-Regular Induced Subgraph Problem
- Spectra of Laplacian matrices of weighted graphs: structural genericity properties
- Free energy on a cycle graph and trigonometric deformation of heat kernel traces on odd spheres
- Decentralized observers with consensus filters for distributed discrete-time linear systems
- From continues to discrete - Yau's work on graph theory
- scientific article; zbMATH DE number 2149406 (Why is no real title available?)
- scientific article; zbMATH DE number 850069 (Why is no real title available?)
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
- Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products
- A unified framework for structured graph learning via spectral constraints
- Sampling by averages and average splines on Dirichlet spaces and on combinatorial graphs
- Spectra of \(M\)-rooted product of graphs
- Organisational hierarchy constructions with easy Kuramoto synchronisation
- Spectra of bowtie product of graphs
- Max-cut and extendability of matchings in distance-regular graphs
- The Laplacian-energy like of graphs
- Graphs whose normalized Laplacian has three eigenvalues
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352274)
