Generalized degree-based graph entropies (Q2333475): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3390/sym9030029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2593976174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative methods for ecological network analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry in complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information theory of networks / 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: 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: Extremality of degree-based graph entropies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-based entropies of networks revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bound and lower bound for degree-based network entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5801644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On measures of information and their characterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the measurable solution of a functional equation arising in information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new entropic method of dimensionality reduction specially designed for multiclass discrimination (DIRECLADIS) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Series expansion of the directed percolation probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3369105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2975360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2975365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2975369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for degree-based network entropies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Estrada index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5408287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5408315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5408268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5408276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2975361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2975320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the sum of squares of degrees in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4928204 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:01, 20 July 2024

scientific article
Language Label Description Also known as
English
Generalized degree-based graph entropies
scientific article

    Statements

    Generalized degree-based graph entropies (English)
    0 references
    0 references
    0 references
    13 November 2019
    0 references
    Summary: Inspired by the generalized entropies for graphs, a class of generalized degree-based graph entropies is proposed using the known information-theoretic measures to characterize the structure of complex networks. The new entropies depend on assigning a probability distribution about the degrees to a network. In this paper, some extremal properties of the generalized degree-based graph entropies by using the degree powers are proved. Moreover, the relationships among the entropies are studied. Finally, numerical results are presented to illustrate the features of the new entropies.
    0 references
    network
    0 references
    information theory
    0 references
    entropy measure
    0 references
    graph entropy
    0 references
    generalized degree-based graph entropy
    0 references
    degree powers
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers