CiteULike is a free online bibliography manager. Register and you can start organising your references online.
Tags

Bounds on connective constants of regular graphs

by: Geoffrey R. Grimmett, Zhongyang Li
(23 Oct 2012)  Key: citeulike:11534332

Formatted Citation


Show HTML

Likes (beta)

This copy of the article hasn't been liked by anyone yet.

View FullText article


Abstract

Bounds are proved for the connective constant $μ$ of an infinite, connected, $Δ$-regular graph $G$. The main result is that $μ ≥ \sqrtΔ-1$ if $G$ is vertex-transitive and simple. This inequality is proved subject to weaker conditions under which it is sharp.


nclisby's tags for this article

Citations (CiTO)

No CiTO relationships defined

X There are no reviews yet

X Posting History


X Export records

Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.