Displaying similar documents to “Diameter in walk graphs.”

Toughness of K a , t -minor-free graphs.

Chen, Guantao, Egawa, Yoshimi, Kawarabayashi, Ken-ichi, Mohar, Bojan, Ota, Katsuhiro (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the isoperimetry of graphs with many ends

Christophe Pittet (1998)

Colloquium Mathematicae

Similarity:

Let X be a connected graph with uniformly bounded degree. We show that if there is a radius r such that, by removing from X any ball of radius r, we get at least three unbounded connected components, then X satisfies a strong isoperimetric inequality. In particular, the non-reduced l 2 -cohomology of X coincides with the reduced l 2 -cohomology of X and is of uncountable dimension. (Those facts are well known when X is the Cayley graph of a finitely generated group with infinitely many ends.) ...