On the isoperimetry of graphs with many ends

Christophe Pittet

Displaying similar documents to “On the isoperimetry of graphs with many ends”

Extremal graph theory for metric dimension and diameter.

Hernando, Carmen, Mora, Mercè, Pelayo, Ignacio M., Seara, Carlos, Wood, David R. (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A conjecture of Biggs concerning the resistance of a distance-regular graph.

Markowsky, Greg, Koolen, Jacobus (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Hosoya polynomial of Hanoi graphs

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

Kragujevac Journal of Mathematics

Similarity:

Antichains in the homomorphism order of graphs

Dwight Duffus, Peter, L. Erdös, Jaroslav Nešetřil, Lajos Soukup (2007)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let $𝔾$ and $𝔻$ , respectively, denote the partially ordered sets of homomorphism classes of finite undirected and directed graphs, respectively, both ordered by the homomorphism relation. Order theoretic properties of both have been studied extensively, and have interesting connections to familiar graph properties and parameters. In particular, the notion of a duality is closely related to the idea of splitting a maximal antichain. We construct both splitting and non-splitting infinite maximal...