Abstract

We prove that if $G$ is a graph without 3-cycles and 4-cycles, then the discrete cubical homology of $G$ is trivial in dimension $d$ for all $d\ge 2$. We also construct a sequence $\{G_d\}$ of grap...

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call