DEGREE-BASED GINI INDEX FOR GRAPHS

Author:

Domicolo Carly,Mahmoud Hosam

Abstract

AbstractIn Balaji and Mahmoud [1], the authors introduced a distance-based Gini index for rooted trees. In this paper, we introduce a degree-based Gini index (or just simply degree Gini index) for graphs. The latter index is a topological measure on a graph capturing the proximity to regular graphs. When applied across the random members of a class of graphs, we can identify an average measure of regularity for the class. Whence, we can compare the classes of graphs from the vantage point of closeness to regularity.We develop a simplified computational formula for the degree Gini index and study its extreme values. We show that the degree Gini index falls in the interval [0, 1). The main focus in our study is the degree Gini index for the class of binary trees. Via a left-packing transformation, we show that, for an arbitrary sequence of binary trees, the Gini index has inferior and superior limits in the interval [0, 1/4]. We also show, via the degree Gini index, that uniform rooted binary trees are more regular than binary search trees grown from random permutations.

Publisher

Cambridge University Press (CUP)

Subject

Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability

Reference22 articles.

1. The degree profile and weight in Apollonian networks and k-trees

2. An axiomatization of the Gini coefficient

3. A note on the distribution of the three types of nodes in uniform binary trees;Prodinger;Seminaire Lotharingien de Combinatoire,1996

4. Polya Urn Models

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. CoRMAC: A Connected Random Topology Formation With Maximal Area Coverage in Wireless Ad-Hoc Networks;IEEE Internet of Things Journal;2023-07-15

2. Topological indices for random spider trees;Main Group Metal Chemistry;2023-01-01

3. Gini index on generalized r-partitions;Mathematica Slovaca;2022-10-01

4. Several Topological Indices of Random Caterpillars;Methodology and Computing in Applied Probability;2021-09-11

5. Investigating Several Fundamental Properties of Random Lobster Trees and Random Spider Trees;Methodology and Computing in Applied Probability;2021-04-26

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3