scientific article; zbMATH DE number 510844
From MaRDI portal
Publication:4281312
Recommendations
Cited in
(59)- The Laplacian spectral radius of a graph under perturbation
- Some results on the Laplacian eigenvalues of unicyclic graphs
- Average distance in graphs and eigenvalues
- Multiple eigenvalues in optimization problems
- Optimal linear labelings and eigenvalues of graphs
- Laplacian matrices of graphs: A survey
- Semidefinite programming in combinatorial optimization
- Spectral methods for graph bisection problems.
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data
- A novel neural network for solving semidefinite programming problems with some applications
- Exact bounds on the order of the maximum clique of a graph.
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
- Graph Laplacians, nodal domains, and hyperplane arrangements
- Solving the max-cut problem using eigenvalues
- On graphs whose Laplacian index does not exceed 4.5
- Potential energy principles in networked systems and their connections to optimization problems on graphs
- On the N-spectrum of oriented graphs
- Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs
- The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- The algebraic connectivity of graphs with given circumference
- Bandwidth, vertex separators, and eigenvalue optimization
- Spectral properties of unimodular lattice triangulations
- A CONTINUATION APPROACH USING NCP FUNCTION FOR SOLVING MAX-CUT PROBLEM
- scientific article; zbMATH DE number 3968498 (Why is no real title available?)
- Matrix power inequalities and the number of walks in graphs
- The smallest Laplacian spectral radius of graphs with a given clique number
- scientific article; zbMATH DE number 1054729 (Why is no real title available?)
- scientific article; zbMATH DE number 1931602 (Why is no real title available?)
- A spectral algorithm for envelope reduction of sparse matrices
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
- scientific article; zbMATH DE number 907925 (Why is no real title available?)
- The traveling salesman problem: the spectral radius and the length of an optimal tour
- Bounds for the Laplacian spectral radius of graphs
- On maximum signless Laplacian Estrada index of graphs with given parameters. II
- scientific article; zbMATH DE number 7626764 (Why is no real title available?)
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
- The Maximum k-Colorable Subgraph Problem and Related Problems
- Sherali-adams strikes back
- Sherali-Adams strikes back
- Semidefinite programming and combinatorial optimization
- A probabilistic result for the max-cut problem on random graphs
- Graph spectra in computer science
- Embedding and the first Laplace eigenvalue of a finite graph
- Simple eigenvalues of cubic vertex-transitive graphs
- Higher order fluctuations of extremal eigenvalues of sparse random matrices
- Laplace eigenvalues of graphs---a survey
- Fluctuation of the largest eigenvalue of a kernel matrix with application in graphon-based random graphs
- On a hierarchy of spectral isomorphism invariants
- On a hierarchy of spectral invariants for graphs
- Almost borderenergetic line graphs
- Semidefinite programming for discrete optimization and matrix completion problems
- Fluctuations of the free energy of the spherical Sherrington-Kirkpatrick model with sparse interaction
- Gonality of expander graphs
- Spectral properties of King's graph
- Two chromatic numbers, eigenvalues and a generalized Lovász theta
- Upper bounds on algebraic connectivity via convex optimization
- The Laplacian spectral radius for unicyclic graphs with given independence number
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 Q4281312)
