Bell's Degree Variance and Degree Deviation in Graphs: Analyzing Optimal Graphs Based on These Irregularity Measures
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
An irregularity measure (IM) of a connected graph $G$ is defined as a non-negative graph invariant that satisfies the condition $IM(G) = 0$ if and only if $G$ is a regular graph. Among the prominent degree-based irregularity measures are Bell's degree variance, denoted as $Var_B(G)$, and degree deviation, represented as $S(G)$. Specifically, they are defined by the equations $Var_B(G) = \frac{1}{n} \sum_{i=1}^{n} \left( d_i - \frac{2m}{n} \right)^2$ and $S(G)=\sum_{i=1}^n \left|d_i- \frac{2m}{n}\right |$, where $m$ is the number of edges and $n$ is the number of vertices in $G$. This paper studies the properties of Bell's degree-variance and degree deviation for acyclic, unicyclic, and cactus graphs. Our analysis shows how these measures relate to graph topology and structure, influencing the overall irregularity. Additionally, we identify and analyze optimal graphs that minimize both irregularity measures, providing insights into their implications for network design, data structure optimization, and real-world applications. This study contributes to the understanding of graph irregularity and offers a framework for future research into irregularity measures across different classes of graphs.
Keywords:
Language:
English
Published:
Control and Optimization in Applied Mathematics, Volume:10 Issue: 1, Winter-Spring 2025
Pages:
109 to 123
https://www.magiran.com/p2866401
سامانه نویسندگان
مقالات دیگری از این نویسنده (گان)
-
Identification of communities in social networks based on game theory with stable coalitions
Mohammad Vali Hairan, Ali Delavar Khalafi *, , Zahra Nikooeinejad, Mahdiyeh Hasheminezhad
Journal of Mathematics and Society, Summer 2025 -
A New Algorithm for Computing the Frobenius Number
Abbas Taheri, *
Journal of Algorithms and Computation, Dec 2023