Skip to main content
SpringerLink
Log in
Book cover

Combinatorial and Graph-Theoretical Problems in Linear Algebra pp 107–151Cite as

Eigenvalues in Combinatorial Optimization

  • Conference paper

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 50))

Abstract

In the last decade many important applications of eigenvalues and eigenvectors of graphs in combinatorial optimization were discovered. The number and importance of these results is so fascinating that it makes sense to present this survey.

Supported by The Institute for Mathematics and Its Applications, University of Minnesota, and by the Ministry of Science and Technology of Slovenia.

On leave at the Institute für Diskrete Mathematik, Universität Bonn, supported by the A. von Humboldt Foundation.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Aldous, On the time taken by random walks on finite groups to visit every state, ZW 62 (1983) 361–374.

    Article  MathSciNet  MATH  Google Scholar 

  2. D. Aldous, Hitting times for random walks on vertex-transitive graphs, Math. Proc. Camb. Phil. Soc. 106 (1989) 179–191.

    Article  MathSciNet  MATH  Google Scholar 

  3. D. Aldous, Lower bounds for covering times for reversible Markov chains and random walks on graphs, J. Theoret. Probab. 2 (1989) 91–100.

    Article  MathSciNet  MATH  Google Scholar 

  4. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rakoff, Random walks, universal traversal sequences, and the complexity of maze problems, in “20th FOCS,” IEEE, 1979, 218–223.

    Google Scholar 

  5. N. Alon, Eigenvalues and expanders, Combinatorica 6 (1986) 83–96.

    Article  MathSciNet  MATH  Google Scholar 

  6. N. Alon, V. D. Milman, λ1, isoperimetric inequalities for graphs and superconcentrators, J. Combin. Theory, Ser. B 38 (1985) 73–88.

    Article  MathSciNet  MATH  Google Scholar 

  7. W. N. Anderson and T. D. Morley, Eigenvalues of a Laplacian of a graph, Lin. Multilin. Alg. 18 (1985) 141–145.

    Article  MathSciNet  MATH  Google Scholar 

  8. B. Aspvall and J. R. Gilbert, Graph coloring using eigenvalue decomposition, SIAM J. Alg. Disc. Meth. 5 (1984) 526–538.

    Article  MathSciNet  MATH  Google Scholar 

  9. F. Barahona and A. R. Mahjoub, On the cut polytope, Math. Prog. 36 (1986) 157–173.

    Article  MathSciNet  MATH  Google Scholar 

  10. E. R. Barnes, An algorithm for partitioning the nodes of a graph, SIAM J. Alg. Disc. Meth. 3 (1982) 541–550.

    Article  MATH  Google Scholar 

  11. E. R. Barnes, Partitioning the nodes of a graph, in “Graph Theory and its Applications to Algorithms and Computer Science,” Ed. Y. Alavi, Wiley, 1985, pp. 57–72.

    Google Scholar 

  12. E. R. Barnes and A. J. Hoffman, Partitioning, spectra, and linear programming, in: “Progress in Combinatorial Optimization” (W. Pulleyblank, ed.), Academic Press, 1984, pp. 13–25.

    Google Scholar 

  13. E. R. Barnes and A. J. Hoffman, On transportation problems with upper bounds on leading rectangles, SIAM J. Alg. Discr. Meth. 6 (1985) 487–496.

    Article  MathSciNet  MATH  Google Scholar 

  14. C. Berge, Graphs, North-Holland, Amsterdam, 1985.

    MATH  Google Scholar 

  15. F. Bien, Constructions of telephone networks by group representations, Notices Amer. Math. Soc. 36 (1989) 5–22.

    MathSciNet  MATH  Google Scholar 

  16. N. L. Biggs, Algebraic graph theory, Cambridge Univ. Press, Cambridge, 1974.

    MATH  Google Scholar 

  17. M. Bolla, Relations between spectral and classification properties of multigraphs, DIMACS Technical Report 91–27, 1991.

    Google Scholar 

  18. R. B. Boppana, Eigenvalues and graph bisection: An average case analysis, 28th Annual Symp. Found. Comp. Sci., IEEE, 1987, pp. 280–285.

    Google Scholar 

  19. G. Brightwell, P. Winkler, Maximum hitting time for random walks on graphs, Random Str. Algor. 1 (1990).

    Google Scholar 

  20. A. Z. Broder, A. R. Karlin, Bounds on the cover time, J. Theoret. Probab. 2 (1989) 101–120.

    Article  MathSciNet  MATH  Google Scholar 

  21. A. Broder, E. Shamir, On the second eigenvalue of random regular graphs, 28th Annual Symp. Found. Comp. Sci., IEEEE, 1987, pp. 286–294.

    Google Scholar 

  22. R. Brooks, Combinatorial problems in spectral geometry, in “Curvature and topology of Riemannian manifolds”, Lecture Notes in Math. 1201, Springer, 1986, pp. 14–32.

    Chapter  Google Scholar 

  23. R. E. Burkard, Quadratic assignment problem, Europ. J. Oper. Res. 15 (1984) 283–289.

    Article  MathSciNet  MATH  Google Scholar 

  24. P. Buser, On the bipartition of graphs, Discrete Appl. Math. 10 (1984) 105–109.

    Article  MathSciNet  Google Scholar 

  25. J. Cheeger, A lower bound for the smallest eigenvalue of the Laplacian, in “Problems in analysis,” (R.C. Gunnig, ed.), Princeton Univ. Press, 1970, pp. 195–199.

    Google Scholar 

  26. P. Z. Chinn, J. Chvátalová, A. K. Dewdney, N. E. Gibbs, The bandwidth problem for graphs and matrices — a survey, J. Graph Theory 6 (1982) 223–254.

    Article  MathSciNet  MATH  Google Scholar 

  27. F. R. K. Chung, Labelings of graphs, in “Selected Topics in Graph Theory 3,” Academic Press, 1988, pp. 151–168.

    Google Scholar 

  28. F. R. K. Chung, Diameter and eigenvalues, J. Amer. Math. Soc. 1 (1989) 187–196.

    Article  Google Scholar 

  29. F. R. K. Chung, V. Faber, and T. Manteuffel, An upper bound on the diameter of a graph from eigenvalues associated with its Laplacian, preprint, 1989.

    Google Scholar 

  30. J. Cullum, W. E. Donath and P. Wolfe, The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices, Math. Prog. Study 3 (1976) 55–69.

    Google Scholar 

  31. J. K. Cullum and R. A. Willoughby, Lanczos methods for large symmetric eigenvalue computations, Volume 1 and 2, Birkhäuser, Basel, 1985.

    Google Scholar 

  32. D. M. Cvetković, Chromatic number and the spectrum of a graph, Publ. Inst. Math. (Beograd) 14 (1972) 25–38.

    MathSciNet  Google Scholar 

  33. D. M. Cvetković, M. Doob, I. Gutman, and A. Torgašev, Recent results in the theory of graph spectra, Ann. Discr. Math. 36, North-Holland, 1988.

    MATH  Google Scholar 

  34. D. M. Cvetković, M. Doob and H. Sachs, Spectra of graphs, Academic Press, New York, 1979.

    Google Scholar 

  35. C. Delorme and S. Poljak, Laplacian eigenvalues and the maximum cut problem, Technical Report 599, Université de Paris-Sud, Centre d’Orsay, 1990.

    Google Scholar 

  36. C. Delorme and S. Poljak, Combinatorial properties and the complexity of a max-cut approximation, Technical Report 91687, Institut für Diskrete Mathematik, Universität Bonn, 1991.

    Google Scholar 

  37. C. Delorme and S. Poljak, The performance of an eigenvalue bound on the max-cut problem in some classes of graphs, in “Colloque Marseille,” 1990.

    Google Scholar 

  38. C. Delorme, P. Sole, Diameter, covering radius and eigenvalues, Europ. J. Combin. 12 (1991) 95–108.

    MathSciNet  MATH  Google Scholar 

  39. P. Diaconis, D. Stroock, Geometric bounds for eigenvalues of Markov chains, preprint, 1989.

    Google Scholar 

  40. D. Z. Djoković, Distance preserving subgraphs of hypercubes, J. Combin. Theory, Ser. B 14 (1973) 263–267.

    Article  MATH  Google Scholar 

  41. J. Dodziuk, Difference equations, isoperimetric inequality and transience of certain random walks, Trans. Amer. Math. Soc. 24 (1984) 787–794.

    Article  MathSciNet  Google Scholar 

  42. W. E. Donath and A. J. Hoffman, Lower bounds for the partitioning of graphs, IBM J. Res. Develop. 17 (1973) 420–425.

    Article  MathSciNet  MATH  Google Scholar 

  43. M. Dyer, A. Frieze, and R. Kannan, A random polynomial-time algorithm for approximating the volume of convex bodies J. Assoc. Comput. Mach. 38 (1991) 1–17.

    Article  MathSciNet  MATH  Google Scholar 

  44. K. Fan, On a theorem of Weyl concerning eigenvalues of linear transformations. I, Proc. Nat. Acad. Sci. U.S.A. 35 (1949) 652–655.

    Article  MathSciNet  Google Scholar 

  45. M. Fiedler, Algebraic connectivity of graphs, Czech. Math. J. 23 (98) (1973) 298–305.

    MathSciNet  Google Scholar 

  46. M. Fiedler, A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory, Czech. Math. J. 25 (100) (1975) 619–633.

    MathSciNet  Google Scholar 

  47. M. Fiedler, Laplacian of graphs and algebraic connectivity, in “Combinatorics and graph theory”, Banach Center Publ. 25, Warsaw, 1989, pp. 57–70.

    Google Scholar 

  48. G. Finke, R. E. Burkard and F. Rendl, Quadratic assignment problem, Annals of Discrete Mathematics 31 (1987) 61–82.

    MathSciNet  Google Scholar 

  49. S. Friedland, Lower bounds for the first eigenvalue of certain M-matrices associated with graphs, preprint, 1991.

    Google Scholar 

  50. J. Friedman, On the second eigenvalue and random walks in random d-regular graphs, Combinatorica 11 (1991) 331–362.

    Article  MathSciNet  MATH  Google Scholar 

  51. J. Friedman, J. Kahn, and E. Szemerédi, On the second eigenvalue in random regular graphs, Proc. 21st Annual ACM Symp. Theory Comput., Seattle, 1989 (ACM, New York, 1989) pp. 587–598.

    Google Scholar 

  52. Z. Füredi and J. Komlós, The eigenvalues of random symmetric matrices, Combinatorica 1 (1981) 233–241.

    Article  MathSciNet  MATH  Google Scholar 

  53. M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, San Francisco, Freeman, 1979.

    MATH  Google Scholar 

  54. M. R. Garey, D. S. Johnson, R. L. Stockmeyer, Some simplified NP-complete problems, Proc. 6th ACM Symposium on Theory of Computing, 1974, pp. 47–63.

    Google Scholar 

  55. C. D. Godsil, Tools from linear algebra, Research Rep. CORR 89–35, University of Waterloo, 1989.

    Google Scholar 

  56. C. D. Godsil, B. Mohar, Walk-generating functions and spectral measures of infinite graphs, Linear Algebra Appl. 107 (1988) 191–206.

    Article  MathSciNet  MATH  Google Scholar 

  57. M. K. Goldberg, R. Gardner, On the minimal cut problem, in “Progress in Graph Theory”, Eds. J. A. Bondy and U. S. R. Murty, Academic Press, Toronto, 1984, pp. 295–305.

    Google Scholar 

  58. G. H. Golub and C. F. van Loan, Matrix Computations, Johns Hopkins Series in the Mathematical Sciences, Johns Hopkins Univ. Press, Second edition, 1989.

    MATH  Google Scholar 

  59. R. L. Graham, Isometric embeddings of graphs, in: “Selected Topics in Graph Theory 3” (L. W. Beineke, R. J. Wilson, eds.), Academic Press, 1988.

    Google Scholar 

  60. R. L. Graham and H. O. Pollack, On the addressing problem for loop switching, Bell Syst. Tech. J. 50 (1971) 2495–2519.

    MATH  Google Scholar 

  61. M. Gromov, V. D. Milman, A topological application of the isoperimetric inequality, Amer. J. Math. 105 (1983) 843–854.

    Article  MathSciNet  MATH  Google Scholar 

  62. M. Grötschel, L. Lovász, and A. Schrijver, Geometric algorithms and combinatorial optimization, Springer-Verlag, Berlin, 1988.

    MATH  Google Scholar 

  63. S. W. Hadley, F. Rendl, and H. Wolkowicz, Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality, Linear Algebra Appl. 167 (1992) 53–64.

    Article  MathSciNet  MATH  Google Scholar 

  64. S. W. Hadley, F. Rendl, and H. Wolkowicz, Bounds for the quadratic assignment problem using continuous optimization techniques, Proc. “Combinatorial Optimization”, Waterloo, 1990, pp. 237–248.

    Google Scholar 

  65. S. W. Hadley, F. Rendl, and H. Wolkowicz, A new lower bound via projection for the quadratic assignment problem, preprint 1991.

    Google Scholar 

  66. F. O. Hadlock, Finding a maximum cut of a planar graph in polynomial time, SIAM J. Comput. 4 (1975) 221–225.

    Article  MathSciNet  MATH  Google Scholar 

  67. A. J. Hoffman, On eigenvalues and colorings of graphs, in “Graph Theory and Its Applications” (B. Harris, ed.), Acad. Press, 1970, pp. 79–91.

    Google Scholar 

  68. A. J. Hoffman and H. W. Wielandt, The variation of the spectrum of a normal matrix, Duke Math. J. 20 (1953) 37–39.

    Article  MathSciNet  MATH  Google Scholar 

  69. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, 1985.

    MATH  Google Scholar 

  70. M. Jerrum, A. Sinclair, Approximating the permanent, SIAM J. Comput. 18 (1989) 1149–1178.

    Article  MathSciNet  MATH  Google Scholar 

  71. F. Juhász, On the spectrum of a random graph, in: “Algebraic Methods in Graph Theory” (L. Lovász, V. T. Sós, eds.), Colloq. Math. Soc. J. Bolyai 25, North-Holland, Amsterdam, 1982, pp. 313–316.

    Google Scholar 

  72. F. Juhász, On the asymptotic behaviour of the spectra of non-symmetric random (0,1) matrices, Discrete Math. 41 (1982) 161–165.

    Article  MathSciNet  MATH  Google Scholar 

  73. F. Juhász, The asymptotic behaviour of Lovász’ ϑ function for random graphs, Combinatorica 2 (1982) 153–155.

    Article  MathSciNet  MATH  Google Scholar 

  74. F. Juhász, The asymptotic behaviour of Fiedler’s algebraic connectivity for random graphs, Discrete Math. 96 (1991) 59–63.

    Article  MathSciNet  MATH  Google Scholar 

  75. F. Juhász, On a method of cluster analysis, ZAMM 64 (1984) T335–T336.

    Google Scholar 

  76. F. Juhász, On the theoretical backgrounds of cluster analysis based on the eigenvalue problem of the association matrix, Statistics 20 (1989) 573–581.

    Article  MathSciNet  MATH  Google Scholar 

  77. F. Juhász and K. Mályusz, Problems of cluster analysis from the viewpoint of numerical analysis, in: “Numerical Methods”, Colloq. Math. Soc. J. Bolyai 22, North- Holland, Amsterdam, 1977, pp. 405–415.

    Google Scholar 

  78. M. Juvan and B. Mohar, Optimal linear labelings and eigenvalues of graphs, to appear in Discr. Appl. Math.

    Google Scholar 

  79. M. Juvan and B. Mohar, Laplace eigenvalues and band width-type invariants of graphs, preprint, 1990.

    Google Scholar 

  80. J. N. Kahn, N. Linial, N. Nisan, M. E. Saks, On the cover time of random walks on graphs, J. Theoret. Probab. 2 (1989) 121–128.

    Article  MathSciNet  MATH  Google Scholar 

  81. R. M. Karp, Reducibility among combinatorial problems, in: “Complexity of Computer Computation” (R. E. Miller, J. W. Thather, eds), Plenum Press, New York, 1972, pp. 85–103.

    Google Scholar 

  82. J. G. Kemeny, J. L. Snell, Finite Markov chains, Van Nostrand, 1960.

    MATH  Google Scholar 

  83. P. Lancaster, Theory of matrices. Academic Press, 1969.

    MATH  Google Scholar 

  84. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, J. Wiley, New York, 1990.

    MATH  Google Scholar 

  85. L. Lovász, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory IT-25 (1979) 1–7.

    Article  Google Scholar 

  86. L. Lovász, Combinatorial Problems and Exercises, North-Holland, Amsterdam, 1979.

    MATH  Google Scholar 

  87. L. Lovász, M. Simonovits, The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume, preprint, 1990.

    Google Scholar 

  88. A. Lubotzky, Discrete groups, expanding graphs and invariant measures, manuscript, 1989.

    Google Scholar 

  89. A. Lubotzky, R. Phillips and P. Sarnak, Ramanujan graphs, Combinatorica 8 (1988) 261–277.

    Article  MathSciNet  MATH  Google Scholar 

  90. G. A. Margulis, Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators, Problemy Pered. Inform. 24 (1988) 51–60 (in Russian); Engl. transl. Problems Inform. Transm. 24 (1988) 39–46.

    MathSciNet  Google Scholar 

  91. B. D. McKay, The expected eigenvalue distribution of a large regular graph, Lin. Algebra Appl. 40 (1981) 203–216.

    Article  MathSciNet  MATH  Google Scholar 

  92. R. Merris, An edge version of the Matrix-Tree Theorem and the Wiener index, Lin. Multilin. Alg. 25 (1989) 291–296.

    Article  MathSciNet  MATH  Google Scholar 

  93. R. Merris, The distance spectrum of a tree, J. Graph Theory 14 (1990) 365–369.

    Article  MathSciNet  MATH  Google Scholar 

  94. B. Mohar, Isoperimetric inequalities, growth, and the spectrum of graphs, Linear Algebra Appl. 103 (1988) 119–131.

    Article  MathSciNet  MATH  Google Scholar 

  95. B. Mohar, Isoperimetric numbers of graphs, J. Combin. Theory, Ser. B 47 (1989) 274–291.

    Article  MathSciNet  MATH  Google Scholar 

  96. B. Mohar, The Laplacian spectrum of graphs, in: “Graph Theory, Combinatorics, and Applications,” (Y. Alavi et al., eds.), J. Wiley, New York, 1991, pp. 871–898.

    Google Scholar 

  97. B. Mohar, Eigenvalues, diameter, and mean distance in graphs, Graphs Comb. 7 (1991) 53–64.

    Article  MathSciNet  MATH  Google Scholar 

  98. B. Mohar, Some algebraic methods in graph theory and combinatorial optimization, Discrete Math., to appear.

    Google Scholar 

  99. B. Mohar and S. Poljak, Eigenvalues and the max-cut problem, Czech. Math. J. 40 (115) (1990) 343–352.

    MathSciNet  Google Scholar 

  100. C. Moler and D. Morrison, Singular value analysis of cryptograms, Amer. Math. Monthly 90 (1983) 78–87.

    Article  MathSciNet  MATH  Google Scholar 

  101. T. Motzkin and E. G. Straus, Maxima for graphs and new proof of a theorem of Turán, Canad. J. Math. 17 (1965) 533–540.

    Article  MathSciNet  MATH  Google Scholar 

  102. G. Narasimhan and R. Manber, A generalization of Lovász Θ function, DIMACS Series in Discrete Math. and Comp. Sci. 1, 1990, pp. 19–27.

    MathSciNet  Google Scholar 

  103. A. Nilli, On the second eigenvalue of a graph, Discrete Math. 91 (1991) 207–210.

    Article  MathSciNet  MATH  Google Scholar 

  104. G. I. Orlova and Y. G. Dorfman, Finding the maximal cut in a graph, Engrg. Cybernetics 10 (1972) 502–506.

    MathSciNet  MATH  Google Scholar 

  105. M. L. Overton, On minimizing the maximum eigenvalue of a symmetric matrix, SIAM J. Matrix Anal. 9 (1988) 256–268.

    Article  MathSciNet  MATH  Google Scholar 

  106. M. L. Overton and R. S. Womersley, On the sum of the largest eigenvalues of a symmetric matrix, SIAM J. Matrix Anal. 13 (1992) 41–45.

    Article  MathSciNet  MATH  Google Scholar 

  107. J. L. Palacios, Bounds on expected hitting times for a random walk on a connected graph, Linear Algebra Appl. 141 (1990) 241–252.

    Article  MathSciNet  MATH  Google Scholar 

  108. J. L. Palacios, On a result of Aleliunas et al. concerning random walks on graphs, Prob. Eng. Info. Sci. 4 (1990) 489–492.

    Article  MATH  Google Scholar 

  109. J. L. Palacios, Expected hitting and cover times of random walks on some special graphs, preprint, 1991.

    Google Scholar 

  110. C. H. Papadimitriou, The NP-completeness of the bandwidth minimization problem, Computing 16 (1976) 263–270.

    Article  MathSciNet  MATH  Google Scholar 

  111. P. M. Pardalos and G. P. Rodgers, Computational aspects of a branch and bound algorithm for quadratic zero-one programming, Computing 40 (1990) 131–144.

    Article  MathSciNet  Google Scholar 

  112. S. Poljak, Polyhedral and eigenvalue approximations of the max-cut problem, Technical Report 91691, Institut für Diskrete Mathematik, Universität Bonn, 1991. Submitted to Proc. Conf. ‘Sets, Graphs and Numbers’ (Budapest 1991).

    Google Scholar 

  113. S. Poljak and F. Rendl, Computing the max-cut by eigenvalues, Report No. 91735- OR, Institut für Diskrete Mathematik, Universität Bonn, 1991.

    Google Scholar 

  114. A. Pothen, H. D. Simon and K.-P. Liou, Partitioning Sparse Matrices with Eigenvectors of Graphs, SIAM J. Matrix Anal. Appl. 11 (1990) 430–452.

    Article  MathSciNet  MATH  Google Scholar 

  115. D. L. Powers, Structure of a matrix according to its second eigenvalue, in: “Current Trends in Matrix Theory” (F. Uhlig and R. Grone, eds.), Elsevier, 1987, pp. 121–133.

    Google Scholar 

  116. D. L. Powers, Graph partitioning by eigenvectors, Linear Algebra Appl. 101 (1988) 121–133.

    Article  MathSciNet  MATH  Google Scholar 

  117. F. Rendl and H. Wolkowicz, Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem, Math. Progr. 53 (1992) 63–78.

    Article  MathSciNet  MATH  Google Scholar 

  118. F. Rendl and H. Wolkowicz, A projection technique for partitioning the nodes of a graph, Technical Report, University of Technology, Graz, 1990.

    Google Scholar 

  119. R. Rubinfeld, The cover time of a regular expander is O(n log n), Inform. Proc. Lett. 35 (1990) 49–51.

    Article  MathSciNet  MATH  Google Scholar 

  120. R. L. Roth and P. M. Winkler, Collapse of the metric hierarchy for bipartite graphs, Europ. J. Combin. 7 (1986) 371–375.

    MathSciNet  MATH  Google Scholar 

  121. T. L. Saaty, A scalling method for priorities in hierarchical structures, J. Math. Psych. 15 (1977) 234–281.

    Article  MathSciNet  MATH  Google Scholar 

  122. H. Schramm and J. Zowe, A combination of the bundle approach and the trust region concept, in: “Advances in Mathematical Optimization” (J. Guddat et al., ed.), Akademie Verlag, Berlin, 1988, pp. 196–209.

    Google Scholar 

  123. D. S. Scott, Block Lanczos software for symmetric eigenvalue problems, Technical Report ORNL/CSD-48, Oak Ridge National Laboratory, 1979.

    Google Scholar 

  124. A. Sinclair, M. Jerrum, Approximate counting, uniform generation and rapidly mixing Markov chains, Inform. and Comput. 82 (1989) 93–133.

    Article  MathSciNet  MATH  Google Scholar 

  125. P. Sole, Expanding and forwarding, submitted.

    Google Scholar 

  126. A. Srivastav and P. Stangier, A provably good algorithm for the graph partitioning problem, Preprint of Institute of Discrete Math., Univ. Bonn, 1991.

    Google Scholar 

  127. P. D. Straffin, Jr., Linear algebra in geography: Eigenvectors of networks, Math. Mag. 53 (1980) 269–276.

    Article  MathSciNet  MATH  Google Scholar 

  128. V. S. Sunderam, P. Winkler, Fast information sharing in a distributed system, preprint, 1988.

    Google Scholar 

  129. R. M. Tanner, Explicit concentrators from generalized n-gons, SIAM J. Alg. Discr. Meth. 5 (1984) 287–293.

    Article  MathSciNet  MATH  Google Scholar 

  130. N. Th. Varopoulos, Isoperimetric inequalities and Markov chains, J. Funct. Anal. 63 (1985) 215–239.

    Article  MathSciNet  MATH  Google Scholar 

  131. E. P. Wigner, Characteristic vectors of bordered matrices with infinite dimensions, Ann. Math. 62 (1955) 548–564.

    Article  MathSciNet  MATH  Google Scholar 

  132. H. S. Wilf, The eigenvalues of a graph and its chromatic number, J. London Math. Soc. 42 (1967) 330–332.

    Article  MathSciNet  MATH  Google Scholar 

  133. H. S. Wilf, Graphs and their spectra: Old and new results, Congr. Numer. 50 (1985) 37–42.

    MathSciNet  Google Scholar 

  134. H. S. Wilf, Spectral bounds for the clique and independence numbers of graphs, J. Combin. Theory, Ser. B 40 (1986) 113–117.

    Article  MathSciNet  MATH  Google Scholar 

  135. P. M. Winkler, Proof of the squashed cube conjecture, Combinatorica 3 (1983) 135–139.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Ljubljana, Jadranska 19, 61 111, Ljubljana, Slovenia

    Bojan Mohar

  2. Department of Applied Mathematics, Charles University, Malostranské náměstí 25, 11800, Praha 1, Czechoslovakia

    Svatopluk Poljak

Authors
  1. Bojan Mohar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Svatopluk Poljak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Wisconsin, Madison, WI, 53706, USA

    Richard A. Brualdi

  2. Department of Mathematical Statistics and Computer Science, University of Illinois at Chicago, Chicago, IL, 60680-4348, USA

    Shmuel Friedland

  3. Department of Mathematics, University of Washington, Seattle, WA, 98195-0001, USA

    Victor Klee

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag New York, Inc.

About this paper

Cite this paper

Mohar, B., Poljak, S. (1993). Eigenvalues in Combinatorial Optimization. In: Brualdi, R.A., Friedland, S., Klee, V. (eds) Combinatorial and Graph-Theoretical Problems in Linear Algebra. The IMA Volumes in Mathematics and its Applications, vol 50. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8354-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-8354-3_5

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4613-8356-7

  • Online ISBN: 978-1-4613-8354-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation