An Entropy-Based Proof for the Moore Bound for Irregular Graphs (Q2821702): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import recommendations run Q6767936
Property / Recommended article
 
Property / Recommended article: The Moore bound for irregular graphs / rank
 
Normal rank
Property / Recommended article: The Moore bound for irregular graphs / qualifier
 
Similarity Score: 0.9415511
Amount0.9415511
Unit1
Property / Recommended article: The Moore bound for irregular graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: A Tight Bound on the Irregularity Strength of Graphs / rank
 
Normal rank
Property / Recommended article: A Tight Bound on the Irregularity Strength of Graphs / qualifier
 
Similarity Score: 0.886792
Amount0.886792
Unit1
Property / Recommended article: A Tight Bound on the Irregularity Strength of Graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: A lower bound on graph entropy / rank
 
Normal rank
Property / Recommended article: A lower bound on graph entropy / qualifier
 
Similarity Score: 0.8777731
Amount0.8777731
Unit1
Property / Recommended article: A lower bound on graph entropy / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3474681 / rank
 
Normal rank
Property / Recommended article: Q3474681 / qualifier
 
Similarity Score: 0.87525487
Amount0.87525487
Unit1
Property / Recommended article: Q3474681 / qualifier
 
Property / Recommended article
 
Property / Recommended article: A New Upper Bound for the Irregularity Strength of Graphs / rank
 
Normal rank
Property / Recommended article: A New Upper Bound for the Irregularity Strength of Graphs / qualifier
 
Similarity Score: 0.87439704
Amount0.87439704
Unit1
Property / Recommended article: A New Upper Bound for the Irregularity Strength of Graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: An entropic proof of cutoff on Ramanujan graphs / rank
 
Normal rank
Property / Recommended article: An entropic proof of cutoff on Ramanujan graphs / qualifier
 
Similarity Score: 0.86974883
Amount0.86974883
Unit1
Property / Recommended article: An entropic proof of cutoff on Ramanujan graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: A revised Moore bound for mixed graphs / rank
 
Normal rank
Property / Recommended article: A revised Moore bound for mixed graphs / qualifier
 
Similarity Score: 0.86887217
Amount0.86887217
Unit1
Property / Recommended article: A revised Moore bound for mixed graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: A Spectral Moore Bound for Bipartite Semiregular Graphs / rank
 
Normal rank
Property / Recommended article: A Spectral Moore Bound for Bipartite Semiregular Graphs / qualifier
 
Similarity Score: 0.86633
Amount0.86633
Unit1
Property / Recommended article: A Spectral Moore Bound for Bipartite Semiregular Graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Hypergraphs, Entropy, and Inequalities / rank
 
Normal rank
Property / Recommended article: Hypergraphs, Entropy, and Inequalities / qualifier
 
Similarity Score: 0.8655098
Amount0.8655098
Unit1
Property / Recommended article: Hypergraphs, Entropy, and Inequalities / qualifier
 
Property / Recommended article
 
Property / Recommended article: Some new spectral bounds for graph irregularity / rank
 
Normal rank
Property / Recommended article: Some new spectral bounds for graph irregularity / qualifier
 
Similarity Score: 0.86534977
Amount0.86534977
Unit1
Property / Recommended article: Some new spectral bounds for graph irregularity / qualifier
 

Revision as of 17:55, 18 April 2025

scientific article
Language Label Description Also known as
English
An Entropy-Based Proof for the Moore Bound for Irregular Graphs
scientific article

    Statements

    An Entropy-Based Proof for the Moore Bound for Irregular Graphs (English)
    0 references
    0 references
    0 references
    22 September 2016
    0 references
    girth
    0 references
    Moore bound
    0 references
    graphs
    0 references

    Identifiers