Szeged-like entropies of graphs (Q2152724): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Network entropy using edge-based information functionals / 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: Quantitative Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A history of graph entropy measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mostar index / rank
 
Normal rank
Property / cites work
 
Property / cites work: First degree-based entropy of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5280039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5801644 / rank
 
Normal rank

Latest revision as of 13:49, 29 July 2024

scientific article
Language Label Description Also known as
English
Szeged-like entropies of graphs
scientific article

    Statements

    Szeged-like entropies of graphs (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2022
    0 references
    Szeged entropy
    0 references
    Mostar entropy
    0 references
    PI entropy
    0 references
    cut method
    0 references
    quotient graphs
    0 references
    sensitivity of a topological descriptor
    0 references

    Identifiers

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