Abstract
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. Applying this method to complexes arising from graphs, we give topological meaning to classical graph invariants. As a consequence, we answer some questions raised in (Ehrenborg and Hetyei in Eur. J. Comb. 27(6):906–923, 2006) on the independence complex and the dominance complex of a forest and obtain improved algorithms to compute their homotopy types.
Article PDF
Similar content being viewed by others
References
Allan, R.B., Laskar, R.: On domination and independent domination numbers of a graph. Discrete Math. 23, 73–76 (1978)
Allan, R.B., Laskar, R., Hedetniemi, S.: A note on total domination. Discrete Math. 49, 7–13 (1984)
Beyer, T., Hedetniemi, S., Mitchell, S., Proskurowski, A.: Independent domination in trees. In: Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing, Louisiana State Univ., Baton Rouge, LA, 1977. Congressus Numerantium, vol. XIX, pp. 321–328. Utilitas Math., Winnipeg (1977)
Bollobás, B.: Modern Graph Theory. Graduate Texts in Mathematics, vol. 184. Springer, Berlin (1998)
Bollobás, B., Cockayne, E.J.: Graph-theoretic parameters concerning domination, independence, and irredundance. J. Graph Theory 3(3), 241–249 (1979)
Bousquet-Mélou, M., Linusson, S., Nevo, E.: On the independence complex of square grids. arXiv:math/0701890v2 [math.CO]
Cockayne, E.J., Goodman, S.E., Hedetniemi, S.T.: A linear algorithm for the domination number of a tree. Inf. Process. Lett. 4, 41–44 (1975)
Mitchell, S., Cockayne, E., Hedetniemi, S.: Linear algorithms on recursive representations of trees. J. Comput. Syst. Sci. 18(1), 76–85 (1979)
Cohen, M.M.: A Course in Simple-Homotopy Theory. Graduate Texts in Mathematics, vol. 10. Springer, New York (1973)
Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173. Springer, Berlin (1997)
Engström, A.: Complexes of directed trees and independence complexes. arXiv:math/0508148v1 [math.CO]
Ehrenborg, R., Hetyei, G.: The topology of the independence complex. Eur. J. Comb. 27(6), 906–923 (2006)
Erdős, P., Tuza, Z.: Vertex coverings of the edge set in a connected graph. In: Graph Theory, Combinatorics, and Algorithms, Kalamazoo, MI, 1992, vols. 1, 2, pp. 1179–1187. Wiley-Interscience, New York (1995)
Goodman, S., Hedetniemi, S., Mitchell, S.: Some linear algorithms on trees. In Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic Univ., Boca Raton, FL, 1975. Congressus Numerantium, vol. XIV, pp. 467–483. Utilitas Math., Winnipeg (1975)
Goodman, S., Hedetniemi, S., Tarjan, R.E.: b-matchings in trees. SIAM J. Comput. 5(1), 104–108 (1976)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Monographs and Textbooks in Pure and Applied Mathematics, vol. 208. Marcel Dekker, New York (1998)
Henning, M.A., Yeo, A.: Total domination and matching numbers in claw-free graphs. Electron. J. Comb. 13(1), 59 (2006)
Jonsson, J.: Certain homology cycles of the independence complex of grid graphs. Preprint
Klivans, C.: Threshold graphs, shifted complexes, and graphical complexes. arXiv:math/0703114v1 [math.CO]
Kozlov, D.: Complexes of directed trees. J. Comb. Theory Ser. A 88(1), 112–122 (1999)
Kozlov, D.: Directed trees in a string, real polynomials with triple roots, and chain mails. Discrete Comput. Geom. 32(3), 373–382 (2004)
Laskar, R., Walikar, H.B.: On domination related concepts in graph theory. In: Combinatorics and Graph Theory. Lecture Note in Mathematics, vol. 885, pp. 308–320. Springer, Berlin (1981)
Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra. Graduate Texts in Mathematics, vol. 227. Springer, New York (2005)
Munkres, J.R.: Elements of Algebraic Topology. Perseus Books, London (1984)
Mynhardt, C.M.: Vertices contained in every minimum dominating set of a tree. J. Graph Theory 31(3), 163–177 (1999)
Stanley, R.: Combinatorics and Commutative Algebra, 2nd edn. Progress in Mathematics, vol. 41. Birkhäuser, Basel (1996)
Wassmer, A.: A dual independence complex. PhD thesis, Technische Universität Berlin (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Marietti, M., Testa, D. Cores of Simplicial Complexes. Discrete Comput Geom 40, 444–468 (2008). https://doi.org/10.1007/s00454-008-9081-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-008-9081-y