Network entropies based on independent sets and matchings
From MaRDI portal
Publication:1736140
DOI10.1016/j.amc.2017.02.021zbMath1411.05238OpenAlexW2602532711MaRDI QIDQ1736140
Zhe Kang, Matthias Dehmer, Shu-Juan Cao
Publication date: 29 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.02.021
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (14)
Graph Operations Decreasing Values of Degree-Based Graph Entropies ⋮ On graph entropy measures based on the number of independent sets and matchings ⋮ On measuring the complexity of networks: Kolmogorov complexity versus entropy ⋮ Wiener polarity index of dendrimers ⋮ The coefficients of the immanantal polynomial ⋮ A note on extremal trees with degree conditions ⋮ Nordhaus-Gaddum type results for graph irregularities ⋮ Hosoya entropy of fullerene graphs ⋮ Note on the perfect Roman domination number of graphs ⋮ Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs ⋮ New network entropy : The domination entropy of graphs ⋮ Analyzing lattice networks through substructures ⋮ Vertex-based and edge-based centroids of graphs ⋮ Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Entropy bounds for dendrimers
- On the edge-hyper-Hamiltonian laceability of balanced hypercubes
- Entropy and the complexity of graphs revisited
- An entropy-based uncertainty measurement approach in neighborhood systems
- Extremality of degree-based graph entropies
- Entropy, similarity measure and distance measure of vague soft sets and their relations
- Probabilistic inequalities for evaluating structural network measures
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- A history of graph entropy measures
- A computational approach to construct a multivariate complete graph invariant
- Information processing in complex networks: Graph entropy and information functionals
- Some bounds on entropy measures in information theory
- Degree-based entropies of networks revisited
- Bounds for degree-based network entropies
- Note on two generalizations of the Randić index
- A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration
- Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs
- Fifty years of graph matching, network alignment and network comparison
- A note on distance-based graph entropies
- Graph Polynomials
- Graph Energy
- Mathematical Foundations and Applications of Graph Entropy
- Incidence graphs constructed from t-designs
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- The spectral radius of edge chromatic critical graphs
This page was built for publication: Network entropies based on independent sets and matchings
