The following pages link to (Q5202209):
Displaying 30 items.
- Max \(k\)-cut and the smallest eigenvalue (Q286169) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian (Q662288) (← links)
- 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)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
- The Laplacian spectral radius of a graph under perturbation (Q1005808) (← links)
- Laplacian eigenvalues and partition problems in hypergraphs (Q1023080) (← 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)
- Inverse Perron values and connectivity of a uniform hypergraph (Q1627203) (← 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)
- The product of two high-frequency graph Laplacian eigenfunctions is smooth (Q2111909) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
- On graphs with adjacency and signless Laplacian matrices eigenvectors entries in \(\{-1,+1\}\) (Q2229491) (← links)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- Tighter spectral bounds for the cut size, based on Laplacian eigenvectors (Q2419023) (← links)
- Spectral bounds for the maximum cut problem (Q3632965) (← links)
- Bounds for the Laplacian spectral radius of graphs (Q5006624) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- New results for MaxCut in H$H$‐free graphs (Q6134889) (← links)
