An Entropy-Based Proof for the Moore Bound for Irregular Graphs
type: Item
instance of: scholarly article
title: An Entropy-Based Proof for the Moore Bound for Irregular Graphs
zbMATH Open document ID: 1345.05048
DOI: 10.1007/978-3-319-05446-9_10
author: S. Ajesh Babu
author: Jaikumar Radhakrishnan
published in: Perspectives in Computational Complexity
publication date: 2016-09-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/1011.1058
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C81
zbMATH DE Number: 6629272
zbMATH Keywords: girth
zbMATH Keywords: Moore bound
zbMATH Keywords: graphs
MaRDI profile type: Publication
OpenAlex ID: W1791758941
arXiv ID: 1011.1058
cites work: The Moore bound for irregular graphs
cites work: Algebraic Graph Theory
cites work: Q4023085
cites work: The size of bipartite graphs with a given girth
cites work: Entropy, independent sets and antichains: A new approach to Dedekind's problem
cites work: An upper bound on the number of Steiner triple systems
cites work: An entropy proof of Bregman's theorem
Recommended article: The Moore bound for irregular graphs
Recommended article: A Tight Bound on the Irregularity Strength of Graphs
Recommended article: A lower bound on graph entropy
Recommended article: Q3474681
Recommended article: A New Upper Bound for the Irregularity Strength of Graphs
Recommended article: An entropic proof of cutoff on Ramanujan graphs
Recommended article: A revised Moore bound for mixed graphs
Recommended article: A Spectral Moore Bound for Bipartite Semiregular Graphs
Recommended article: Hypergraphs, Entropy, and Inequalities
Recommended article: Some new spectral bounds for graph irregularity
description: scientific article; zbMATH DE number 6629272