scientific article; zbMATH DE number 4193718
From MaRDI portal
Publication:5202209
zbMATH Open0724.05046MaRDI QIDQ5202209FDOQ5202209
Authors: Bojan Mohar, Svatopluk Poljak 
Publication date: 1990
Full work available at URL: https://eudml.org/doc/13856
Title of this publication is not available (Why is that?)
Recommendations
Cites Work
- Eigenvalues and expanders
- Eigenvalues of the Laplacian of a graph∗
- Title not available (Why is that?)
- On the Shannon capacity of a graph
- Isoperimetric numbers of graphs
- Ramanujan graphs
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Explicit Concentrators from Generalized N-Gons
- Title not available (Why is that?)
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Weakly bipartite graphs and the max-cut problem
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- The max-cut problem on graphs not contractible to \(K_ 5\)
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- Title not available (Why is that?)
- A polynomial algorithm for the max-cut problem on graphs without long odd cycles
- Maximum bipartite subgraphs of Kneser graphs
- A remark on max-cut problem with an application to digital-analogue convertors
- Title not available (Why is that?)
Cited In (34)
- Spectral bounds for the maximum cut problem
- Mathematical programming models and exact algorithms
- Bounds for the Laplacian spectral radius of graphs
- The product of two high-frequency graph Laplacian eigenfunctions is smooth
- The Laplacian spectral radius of a graph under perturbation
- Solving the max-cut problem using eigenvalues
- A projection technique for partitioning the nodes of a graph
- Tighter spectral bounds for the cut size, based on Laplacian eigenvectors
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
- On graphs with adjacency and signless Laplacian matrices eigenvectors entries in \(\{-1,+1\}\)
- Max \(k\)-cut and the smallest eigenvalue
- Title not available (Why is that?)
- Inverse Perron values and connectivity of a uniform hypergraph
- An inequality for eigenvalues of symmetric matrices with applications to max-cuts and Graph Energy∗
- Laplacian matrices of graphs: A survey
- New results for MaxCut in H$H$‐free graphs
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
- Checking robust nonsingularity is NP-hard
- A class of spectral bounds for max \(k\)-cut
- Laplace eigenvalues of graphs---a survey
- Laplacian eigenvalues and the maximum cut problem
- Old and new results on algebraic connectivity of graphs
- On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem
- Some minimax problems for graphs
- Node and edge relaxations of the max-cut problem
- Laplacian eigenvalues and partition problems in hypergraphs
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Title not available (Why is that?)
- Large cuts with local algorithms on triangle-free graphs
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
- A survey of automated conjectures in spectral graph theory
- Max-cut and extendability of matchings in distance-regular graphs
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
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 Q5202209)
