The following pages link to (Q4281312):
Displayed 21 items.
- The smallest Laplacian spectral radius of graphs with a given clique number (Q432731) (← links)
- Graph spectra in computer science (Q627958) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← 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)
- 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)
- 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)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)
- A probabilistic result for the max-cut problem on random graphs (Q5929142) (← links)