Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Matching Trees for Simplicial Complexes and Homotopy Type of Devoid Complexes of Graphs

Matching Trees for Simplicial Complexes and Homotopy Type of Devoid Complexes of Graphs We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes. We then exemplify their efficiency on some simplicial complexes, the devoid complexes of graphs, $\mathcal {D}(G;\mathcal {F})$ whose faces are vertex subsets of G that induce $\mathcal {F}$ -free subgraphs, where G is a multigraph and $\mathcal {F}$ is a family of multigraphs. Additionally, we compute the homotopy type of dominance complexes of chordal graphs. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Order Springer Journals

Matching Trees for Simplicial Complexes and Homotopy Type of Devoid Complexes of Graphs

Order , Volume 33 (3) – Dec 9, 2015

Loading next page...
 
/lp/springer-journals/matching-trees-for-simplicial-complexes-and-homotopy-type-of-devoid-87ALgBFMGW

References (21)

Publisher
Springer Journals
Copyright
Copyright © 2015 by Springer Science+Business Media Dordrecht
Subject
Mathematics; Geometry; Discrete Mathematics in Computer Science; Theory of Computation
ISSN
0167-8094
eISSN
1572-9273
DOI
10.1007/s11083-015-9379-3
Publisher site
See Article on Publisher Site

Abstract

We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes. We then exemplify their efficiency on some simplicial complexes, the devoid complexes of graphs, $\mathcal {D}(G;\mathcal {F})$ whose faces are vertex subsets of G that induce $\mathcal {F}$ -free subgraphs, where G is a multigraph and $\mathcal {F}$ is a family of multigraphs. Additionally, we compute the homotopy type of dominance complexes of chordal graphs.

Journal

OrderSpringer Journals

Published: Dec 9, 2015

There are no references for this article.