DEGREE-BASED GINI INDEX FOR GRAPHS
From MaRDI portal
Publication:5111478
Recommendations
- Sparsity measure of a network graph: Gini index
- Degree and distance based topological indices of graphs
- Degree-based indices of some complex networks
- scientific article; zbMATH DE number 6750355
- Degree-based function index for graphs with given diameter
- Gutman index of some derived graphs
- On discriminativity of vertex-degree-based indices
- Generalized degree-based graph entropies
- THE GINI COEFFICIENT'S APPLICATION TO GENERAL COMPLEX NETWORKS
Cites work
- scientific article; zbMATH DE number 4041254 (Why is no real title available?)
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 1870234 (Why is no real title available?)
- A note on the distribution of the three types of nodes in uniform binary trees
- A note on the height of binary search trees
- An analytic approach to the height of binary search trees. II
- An axiomatization of the Gini coefficient
- Limit laws for local counters in random binary search trees
- Limit laws for the Randić index of random binary tree models
- On the Zagreb index of random recursive trees
- Polya Urn Models
- THE DEGREE PROFILE AND GINI INDEX OF RANDOM CATERPILLAR TREES
- The Gini index of random trees with an application to caterpillars
- The average height of binary trees and other simple trees
- The clustering coefficient of a scale-free random graph
- The degree profile and weight in Apollonian networks and \(k\)-trees
- The joint distribution of the three types of nodes in uniform binary trees
Cited in
(5)
This page was built for publication: DEGREE-BASED GINI INDEX FOR GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111478)