The following pages link to (Q4281312):
Displayed 43 items.
- Spectral properties of unimodular lattice triangulations (Q300599) (← links)
- Matrix power inequalities and the number of walks in graphs (Q403573) (← links)
- The smallest Laplacian spectral radius of graphs with a given clique number (Q432731) (← links)
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra (Q486728) (← links)
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control (Q506453) (← links)
- Graph spectra in computer science (Q627958) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Gonality of expander graphs (Q724872) (← links)
- Upper bounds on algebraic connectivity via convex optimization (Q855560) (← links)
- The Laplacian spectral radius for unicyclic graphs with given independence number (Q984859) (← links)
- The Laplacian spectral radius of a graph under perturbation (Q1005808) (← links)
- Some results on the Laplacian eigenvalues of unicyclic graphs (Q1014473) (← links)
- Average distance in graphs and eigenvalues (Q1025982) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Spectral methods for graph bisection problems. (Q1406654) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data (Q1624673) (← links)
- A novel neural network for solving semidefinite programming problems with some applications (Q1713177) (← links)
- Exact bounds on the order of the maximum clique of a graph. (Q1811073) (← links)
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\) (Q1842163) (← links)
- Graph Laplacians, nodal domains, and hyperplane arrangements (Q1886532) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- On graphs whose Laplacian index does not exceed 4.5 (Q1940309) (← links)
- Potential energy principles in networked systems and their connections to optimization problems on graphs (Q2018871) (← links)
- On the N-spectrum of oriented graphs (Q2053390) (← links)
- Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs (Q2179601) (← links)
- The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum (Q2306004) (← links)
- Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
- Large regular bipartite graphs with median eigenvalue 1 (Q2447959) (← links)
- The algebraic connectivity of graphs with given circumference (Q2632019) (← links)
- A CONTINUATION APPROACH USING NCP FUNCTION FOR SOLVING MAX-CUT PROBLEM (Q3638702) (← links)
- A spectral algorithm for envelope reduction of sparse matrices (Q4852763) (← links)
- (Q4886769) (← links)
- (Q4999440) (← links)
- Bounds for the Laplacian spectral radius of graphs (Q5006624) (← links)
- On maximum signless Laplacian Estrada index of graphs with given parameters II (Q5009979) (← links)
- (Q5053271) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
- (Q5158503) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)
- A probabilistic result for the max-cut problem on random graphs (Q5929142) (← links)