An entropy based proof of the Moore bound for irregular graphs

Ajesh Babu, S. ; Radhakrishnan, Jaikumar (2010) An entropy based proof of the Moore bound for irregular graphs Arxiv-eprints . pp. 1-6.

[img]
Preview
PDF - Author Version
126kB

Official URL: http://arxiv.org/pdf/1011.1058

Abstract

We provide proofs of the following theorems by considering the entropy of random walks.

Item Type:Article
Source:Copyright of this article belongs to Arxiv Publications.
ID Code:89496
Deposited On:27 Apr 2012 13:41
Last Modified:19 May 2016 04:02

Repository Staff Only: item control page