Graph Laplacians, nodal domains, and hyperplane arrangements

Linear Algebra and Its Applications

Volumn 390, Issue 1-3, 2004, Pages 155-174

  Biyikoglu, T ürker ^a,b   Hordijk, Wim ^a   Leydold, Josef ^a   Pisanski, Tomaž ^c   Stadler, Peter F ^b,d,e  

^a VIENNA UNIVERSITY OF ECONOMICS AND BUSINESS   (Austria)

^b UNIVERSITY OF VIENNA   (Austria)

^c UNIVERSITY OF LJUBLJANA   (Slovenia)

^d UNIVERSITY OF LEIPZIG   (Germany)

^e SANTA FE INSTITUTE   (United States)

Author keywords

Graph Laplacians; Hyperplane arrangements; Nodal domains

Indexed keywords

BOUNDARY CONDITIONS; CALCULATIONS; COMPUTATION THEORY; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; HEURISTIC METHODS; MATRIX ALGEBRA;

GRAPH LAPLACIAN; HYPERPLANE ARRANGEMENTS; NODAL DOMAINS; UPPER BOUNDS;

LAPLACE TRANSFORMS;

EID: 4344573239     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2004.04.024     Document Type: Article

References (61)

1. 1, isoperimetric inequalities for graphs, and superconcentrators J. Comb. Theory, Ser. B. 38:1985;73-88.
2. Arnol'd V.I., Vishik M.I., Il'yashenko Y.S., Kalashnikov A.S., Kondrat'ev V.A., Kruzhkov S.N., Landis E.M., Millionshchikov V.M., Oleinik O.A., Filippov A.F., Shubin M.A. Some unsolved problems in the theory of differential equations and mathematical physics. Russian Math. Surveys. 44(4):1989;157-171.
3. Aspvall B., Gilert J.R. Graph coloring using eigenvalue decomposition. SIAM J. Alg. Disc. Meth. 5(4):1984;526-538.
4. Biggs N. Algebraic Graph Theory. second ed. 1994;Cambridge University Press, Cambridge, UK.
5. T. Biyikoglu, Rank and number of nodal domains of cographs, preprint.
6. Biyikoglu T. A discrete nodal domain theorem for trees. Linear Algebra Appl. 360:2003;197-205.
7. Björner A., Las Vergnas M., Sturmfels B., White N., Ziegler G.M. Oriented Matroids. 1993;Cambridge University Press, Cambridge, UK.
8. Brandt S., Pisanski T. Another infinite sequence of dense triangle-free graphs. Electron. J. Comb. 5:1998;633-637. [R43, 5 p.].
9. Chan A., Godsil C.D. Symmetry and eigenvectors. Hahn G., Sabidussi G. Graph Symmetry. Volume 497 of NATO ASI Series, Serie C: Mathematical and Physical Sciences. 1997;75-106 Kluwer Academic Publishers.
10. Chavel I. Eigenvalues in Riemannian Geometry. 1984;Academic Press, Orlando, FL.
11. Cheng S.-Y. Eigenfunctions and nodal sets. Comment. Math. Helvetici. 51:1976;43-55.
12. Chung F.R.K. Spectral Graph Theory, Volume 92 of CBMS. 1997;American Mathematical Society.
13. Cvetković D.M., Doob M., Gutman I., Torgašev A. Recent Results in the Theory of Graph Spectra, Volume 36 of Annals of Discrete Mathematics. 1988;North Holland, Amsterdam, New York, Oxford, Tokyo.
14. Cvetković D.M., Doob M., Sachs H. Spectra of Graphs - Theory and Applications. 1980;Academic Press, New York.
15. Cvetković D.M., Rowlinson P., Simić S. Eigenspaces of Graphs, Volume 66 of Encyclopdia of Mathematics. 1997;Cambridge University Press, Cambridge, UK.
16. Davies E.B., Gladwell G.M.L., Leydold J., Stadler P.F. Discrete nodal domain theorems. Linear Algebra Appl. 336:2001;51-60.
17. Colin de Verdière Y. Sur un nouvel invariant des graphes et un critère de planarité J. Comb. Theory, Ser. B. 50:1990;11-21.
18. Colin de Verdière Y. Multiplicités des valeurs propres laplaciens discrete at laplaciens continus. Rend. Mat. 13:1993;433-460. (in French).
19. Y. Colin de Verdière, Le trou spectral des graphes et leurs propriétés d'expansion, Séminaire de théorie spectral et géométrie, 1993-1994, pp. 51-68.
20. Derrida B. Random energy model: Limit of a family of disordered models. Phys. Rev. Lett. 45:1980;79-82.
21. Derrida B. Random-energy model: An exactly solvable model of disorderes systems. Phys. Rev. B. 24:1981;2613-2626.
22. Devroye L. Non-Uniform Random Variate Generation. 1986;Springer-Verlag, New York.
23. Dress A.W.M., Rumschitzky D.S. Evolution on sequence space and tensor products of representation spaces. Acta Appl. Math. 11:1988;103-115.
24. Duval A.M., Reiner V. Perron-Frobenius type results and discrete versions of nodal domain theorems. Linear Algebra Appl. 294:1999;259-268.
25. Edelsbrunner H. Algorithms in Combinatorial Geometry, Volume 10 of EATCS Monographs on Theoretical Computer Science. 1987;Springer-Verlag.
26. Faria I. Permanental roots and the star degree of a graph. Linear Algebra Appl. 64:1985;255-265.
27. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Math. J. 23:1973;298-305.
28. Fiedler M. Eigenvectors of acyclic matrices. Czechoslovak Math. J. 25:1975;607-618.
29. Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. J. 25:1975;619-633.
30. Fine N.J. The generalized walsh functions. Trans. Am. Math. Soc. 69:1950;66-77.
31. Fishman G.S. Monte Carlo. Concepts, algorithms, and applications. Springer Series in Operations Research. 1996;Springer, New York.
32. P. Fowler, T. Pisanski, J. Shawe-Taylor, Molecular graph eigenvectors for molecular coordinates, In: R. Tamassia, I. Tollis, (Eds.), Graph Drawing, Volume 894 of Lecture Notes in Computer Science, 1995, pp. 282-285.
33. Friedman J. Some geometric aspects of graphs and their eigenfunctions. Duke Math. J. 69(3):1993;487-525.
34. Godsil C.D. Algebraic Combinatorics. 1993;Chapman & Hall, New York.
35. Godsil C.D. Eigenpolytopes of distance-regular graphs. Can. J. Math. 50(4):1998;739-755.
36. Godsil C.D., Royle G.F. Algebraic Graph Theory. 2001;Springer, Heidelberg.
37. Graovac A., Plavšić D., Kaufman M., Pisanski T., Kirby E.C. Application of the adjacency matrix eigenvectors method to geometry determination of toroidal carbon molecules. J. Chem. Phys. 113:2000;1925-1931.
38. Grone R., Merris R., Sunder V. The Laplacian spectrum of a graph. SIAM J. Matrix Anal. Appl. 11:1990;218-238.
39. Grover L.K. Local search and the local structure of NP-complete problems. Oper. Res. Lett. 12:1992;235-243.
40. Guattery S., Miller G.L. On the quality of spectral seperators. SIAM J. Matrix Anal. Appl. 19:1998;701-719.
41. Hordijk W., Stadler P.F. Amplitude spectra of fitness landscapes. Adv. Complex Syst. 1:1998;39-66.
42. Hückel E. Quantentheoretische beiträge zum benzolproblem. Z. Phys. 70:1931;204-286.
43. Imrich W., Klavžar S. Product Graphs: Structure and Recognition. 2000;Wiley, New York.
44. Lászlo I., Rassat A., Fowler P.W., Graovac A. Topological coordinates for toroidal structures. Chem. Phys. Lett. 342:2001;369-374.
45. Lewy H. On the minimum number of domains in which the nodal lines of spherical harmonics divide the sphere. Comm. Partial Diff. Eqns. 2:1977;1233-1244.
46. Leydold J. On the number of nodal domains of spherical harmonics. Topology. 35:1996;301-321.
47. Mohar B. The laplacian spectrum of graphs. Alavi Y., Chartrand G., Ollermann O., Schwenk A. Graph Theory, Combinatorics, and Applications. 1991;871-898 John Wiley and Sons, Inc, New York.
48. Mohar B., Poljak S. Eigenvalues in combinatorial optimization. Brualdi R.A., Friedland S., Klee V. Combinatorial and Graph-Theoretical Problems in Linear Algebra. Volume 50 of IMA Volumes in Mathematics and Its Applications. 1993;107-151 Springer-Verlag, Berlin.
49. Pisanski T., Shawe-Taylor J. Characterising graph drawing with eigenvectors. J. Chem. Inf. Comput. Sci. 40:2000;567-571.
50. Pothen A., Simon H.D., Liou K.-P. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11:1990;430-452.
51. Powers D.L. Graph partitioning by eigenvectors. Linear Algebra Appl. 101:1988;121-133.
52. Reidys C.M., Stadler P.F. Combinatorial landscapes. SIAM Rev. 44:2002;3-54.
53. Roth R. On the eigenvectors belonging to the minimum eigenvalues of an essentially nonnegative symmetric matrix with bipartite graph. Linear Algebra Appl. 118:1989;1-10.
54. Stadler P.F. Landscapes and their correlation functions. J. Math. Chem. 20:1996;1-45.
55. Stadler P.F., Happel R. Random field models for fitness landscapes. J. Math. Biol. 38:1999;435-478.
56. Thulasiraman K., Swamy M.N.S. Graphs: Theory and Algorithms. 1992;J. Wiley & Sons, New York.
57. H. van der Holst, Topological and Spectral Graph Characterizations, PhD thesis, Universiteit van Amsterdam, 1996.
58. Walsh J.L. A closed set of normal orthogonal functions. Amer. J. Math. 45:1923;5-24.
59. Ziegler G.M. Lectures on Polytopes, Volume 152 of Graduate Texts in Mathematics. 1995;Springer-Verlag, New York.