The following pages link to (Q5202209):
Displayed 13 items.
- Laplace eigenvalues of graphs---a survey (Q686298) (← links)
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs (Q686456) (← links)
- Old and new results on algebraic connectivity of graphs (Q876302) (← links)
- The Laplacian spectral radius of a graph under perturbation (Q1005808) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Some minimax problems for graphs (Q1309451) (← links)
- Laplacian eigenvalues and the maximum cut problem (Q1319025) (← links)
- Node and edge relaxations of the max-cut problem (Q1319044) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- Checking robust nonsingularity is NP-hard (Q1802197) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)