Network entropies based on independent sets and matchings (Q1736140): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q972906
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Shu-Juan Cao / rank
 
Normal rank
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.1016/j.amc.2017.02.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2602532711 / 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: Probabilistic inequalities for evaluating structural network measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational approach to construct a multivariate complete graph invariant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and the complexity of graphs revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An entropy-based uncertainty measurement approach in neighborhood systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy, similarity measure and distance measure of vague soft sets and their relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A history of graph entropy measures / 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: Some bounds on entropy measures in information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy bounds for dendrimers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on distance-based graph entropies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the edge-hyper-Hamiltonian laceability of balanced hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral radius of edge chromatic critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence graphs constructed from t-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5156353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremality of degree-based graph entropies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3369105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on two generalizations of the Randić index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-based entropies of networks revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for degree-based network entropies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fifty years of graph matching, network alignment and network comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations and Applications of Graph Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima and minima of the Hosoya index and the Merrifield-Simmons index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5280019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration / rank
 
Normal rank

Latest revision as of 00:43, 19 July 2024

scientific article
Language Label Description Also known as
English
Network entropies based on independent sets and matchings
scientific article

    Statements

    Network entropies based on independent sets and matchings (English)
    0 references
    0 references
    0 references
    0 references
    29 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    Shannon's entropy
    0 references
    graph entropy
    0 references
    independent set
    0 references
    matching
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references