Folding on the wedge sum of graphs and their fundamental group.

Abu-Saleem, M.

Displaying similar documents to “Folding on the wedge sum of graphs and their fundamental group.”

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:

Sets of cospectral graphs with least eigenvalue at least $- 2$ and some related results.

Cvetković, D., Lepović, M. (2004)

Bulletin. Classe des Sciences Mathématiques et Naturelles. Sciences Mathématiques

Similarity:

The number of spanning trees of double graphs

Liu Wu-xin, Wei Fu-yi (2011)

Kragujevac Journal of Mathematics

Similarity:

Hosoya polynomial of Hanoi graphs

Kishori P. Narayankar, S. B. Lokesh, Veena Mathad, Ivan Gutman (2012)

Kragujevac Journal of Mathematics

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.) ...