Extremality of graph entropy based on degrees of uniform hypergraphs with few edges (Q2311742): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q127901993, #quickstatements; #temporary_batch_1722281465132
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1709.09594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremality of degree-based graph entropies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information processing in complex networks: Graph entropy and information functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A history of graph entropy measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing spectral radii of uniform hypergraphs with few edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extremal values of general degree-based graph entropies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs that Split Entropies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal spectral radii of \(k\)-uniform supertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel inequalities for generalized graph entropies -- graph energies and topological indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and the complexity of graphs: I. An index of the relative complexity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and the complexity of graphs: III. Graphs with prescribed information content / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and the complexity of graphs: IV. Entropy measures and graphical structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5801644 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127901993 / rank
 
Normal rank

Latest revision as of 21:42, 29 July 2024

scientific article
Language Label Description Also known as
English
Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
scientific article

    Statements

    Extremality of graph entropy based on degrees of uniform hypergraphs with few edges (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 July 2019
    0 references
    Shannon entropy
    0 references
    graph entropy
    0 references
    degree sequence
    0 references
    hypergraph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references