A spectral lower bound for the treewidth of a graph and its consequences

Information Processing Letters

Volumn 87, Issue 4, 2003, Pages 195-200

  Chandran, L Sunil ^a   Subramanian, C R ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Chordless cycle; Combinatorial problems; Eigenvalue; Graph minor; Hypercube; Laplacian matrix; Treewidth

Indexed keywords

COMBINATORIAL MATHEMATICS; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; TREES (MATHEMATICS);

HYPERCUBES;

GRAPH THEORY;

EID: 0042671272     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00286-2     Document Type: Article

References (21)

1. Alon N. Eigen values and expanders. Combinatorica. 6:1986;83-96.
2. 1, isoperimetric inequalities for graphs and super concentrators. J. Combin. Theory, Ser. B. 38:1985;73-88.
3. Alon N., Seymour P.D., Thomas R. A separator theorem for graphs with an excluded minor and its applications. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. 1990;293-299.
4. Arnborg S. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT. 25:1985;2-23.
5. Arnborg S., Proskurowski A. Linear time algorithms for NP-hard problems on graphs embedded in k -trees. Discrete Appl. Math. 23:1989;11-24.
6. Biggs N. Algebraic Graph Theory. 1993;Cambridge University Press, Cambridge.
7. Bodlaender H.L. A tourist guide through treewidth. Acta Cybernet. 11:1993;1-21.
8. Bodlaender H.L. A linear time algorithm for finding tree decompositions of small treewidth. SIAM J. Comput. 25:1996;1305-1317.
9. Bodlaender H.L., Hagerup T. Parallel algorithms with optimal speedup for bounded treewidth. SIAM J. Comput. 27:1998;1725-1746.
10. Bodlaender H.L., Thilikos D.M. Treewidth for graphs with small chordality. Discrete Appl. Math. 79:1997;45-61.
11. Bondy J.A. Basic graph theory: Paths and circuits. Graham R., Grotschel M., Lovasz L. Handbook of Combinatorics, Vol. 1. 1995;MIT Press, Cambridge, MA.
12. Brouwer A.E., Cohen A.M., Neumaier A. Distance-Regular Graphs. 1989;Springer, Berlin.
13. Chlebikova J. On the tree-width of a graph. Acta Math. Univ. Comen. 61:1992;225-236.
14. Fiedler M. The algebraic connectivity of graphs. Czech. Math. J. 23:1973;298-305.
15. Jájá J. An Introduction to Parallel Algorithms. 1992;Addison-Wesley, Reading, MA.
16. Leighton T. Introduction to Parallel Algorithms and Architectures: Arrays; Trees; Hypercubes. 1992;Academic Press, Morgan Kaufmann, CA.
17. Mohar B. Eigen values, diameter, and mean distance in graphs. Graphs Combin. 7:1991;53-64.
18. Robertson N., Seymour P.D. Graph minors. I. Excluding a forest. J. Combin. Theory, Ser. B. 35:1983;39-61.
19. Robertson N., Seymour P.D. Graph minors. II: Algorithmic aspects of tree-width. J. Algorithms. 7:1986;309-322.
20. Spielman D.A., Teng S.-H. Spectral partitioning works: Planar graphs and finite element meshes. Proceedings of the IEEE Symposium on Foundations of Computer Science. 1996.
21. Thomassen C. Embeddings and minors. Graham R., Grotschel M., Lovasz L. Handbook of Combinatorics, Vol. 1. 1995;MIT Press, Cambridge, MA.