New network entropy : The domination entropy of graphs
From MaRDI portal
Publication:2059882
DOI10.1016/j.ipl.2021.106195OpenAlexW3198059270MaRDI QIDQ2059882
Publication date: 14 December 2021
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106195
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The Hosoya entropy of a graph
- Extremality of degree-based graph entropies
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- A history of graph entropy measures
- Information processing in complex networks: Graph entropy and information functionals
- Dominating sets and domination polynomials of paths
- Network entropies based on independent sets and matchings
- First degree-based entropy of graphs
- On graph entropy measures based on the number of independent sets and matchings
- Mathematical Foundations and Applications of Graph Entropy
- Total edge–vertex domination
- Introduction to Domination Polynomial of a Graph
- On the domination polynomials of friendship graphs
- On Some Applications of Information Indices in Chemical Graph Theory
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
This page was built for publication: New network entropy : The domination entropy of graphs
