🔢 mathematics

Degree Variance and the Fuzzy Sigma Index in Fuzzy Graphs

This paper introduces the fuzzy sigma index as a variance-based measure of structural irregularity for fuzzy graphs, systematically investigating its fundamental properties, deriving sharp bounds, and analyzing its behavior under standard graph operations.

Original authors: Duaa Abdullah

Published 2026-04-16

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Duaa Abdullah

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a city planner looking at a map of a town. In a perfect, boring town, every house has exactly the same number of roads connecting to it. Everyone is equally busy; no one is a "hub" and no one is isolated. In math, we call this a regular graph. It's perfectly balanced.

But real life isn't like that. In a real town, you have a bustling downtown with hundreds of roads (a hub) and quiet cul-de-sacs with just one road (a leaf). This mix of busy and quiet spots is called irregularity.

For a long time, mathematicians had a way to measure this "messiness" in normal, black-and-white maps. They called it the Sigma Index. It's basically a score that tells you: "How different are the neighborhoods from each other?" If the score is zero, the town is perfectly uniform. If the score is high, the town is chaotic and uneven.

The Problem:
Real life isn't black and white. Roads aren't just "there" or "not there." Some roads are super-highways (very strong connections), some are dirt paths (weak connections), and some are barely passable. This is where Fuzzy Graphs come in. They are maps where connections have "strengths" or "weights" (like 0.8 or 0.3) instead of just being 1 or 0.

The author, Duaa Abdullah, asked a big question: "How do we measure the messiness of a fuzzy town?"

The Solution: The Fuzzy Sigma Index

The paper introduces a new tool called the Fuzzy Sigma Index. Think of it as a "Fuzzy Messiness Meter."

Here is how it works, using a simple analogy:

The "Fuzzy Degree": In a normal graph, you just count how many roads a house has. In a fuzzy graph, you add up the strength of the roads. If a house has one super-strong road (strength 1.0) and two weak roads (strength 0.5 each), its "Fuzzy Degree" is 2.0.
The Average: You calculate the average "Fuzzy Degree" for the whole town.
The Variance: You look at every single house. How far is its degree from the average?
- If a house is exactly average, it contributes nothing to the messiness.
- If a house is a super-hub (way above average) or a total isolate (way below average), it adds a lot to the messiness score.
The Score: You square those differences, add them up, and divide by the number of houses. That number is your Fuzzy Sigma Index.

Key Discoveries in the Paper

The author didn't just invent the meter; they tested it to see how it behaves. Here are the main findings, translated into plain English:

1. The "Zero Mess" Rule
If the Fuzzy Sigma Index is zero, the town is perfectly balanced. Every single house has the exact same total connection strength. In math terms, this is a Fuzzy Regular Graph. It's the "perfectly equal" state.

2. The "Maximum Chaos" Rule
What is the most chaotic town possible?
The paper proves that the messiness score hits its highest point when you have a town where all the connection strength is concentrated on just one single road between two houses, and everyone else is completely isolated.

Analogy: Imagine a town where two people are holding hands with a super-strong grip, and 98 other people are standing alone in the dark. That is the peak of irregularity.

3. The "Star" vs. The "Single Edge"
You might think a "Star" graph (one central hub connected to everyone else) is the most chaotic. But the paper shows that a Single Edge graph (just two people connected, everyone else alone) is actually more chaotic in terms of this specific index. The star is messy, but the single edge is extremely messy because the gap between the connected pair and the isolated crowd is massive.

4. Building New Towns (Operations)
The author also looked at what happens when you combine towns:

Union (Gluing two towns side-by-side): The messiness is just the sum of the messiness of the two original towns, plus a little extra penalty if the two towns had very different average sizes.
Cartesian Product (Making a grid): If you take two towns and make a grid out of them, the messiness adds up perfectly. It's like saying: "The total chaos of a grid is just the chaos of the rows plus the chaos of the columns."

Why Does This Matter?

Why should a regular person care about a "Fuzzy Messiness Score"?

Real-World Networks: Real networks (like social media, power grids, or neural networks in the brain) are "fuzzy." Connections vary in strength. This new index helps scientists measure how uneven or "unbalanced" these real-world systems are.
Finding Weak Points: High irregularity often means a system is fragile. If a network is too "star-like" (one big hub), losing that hub crashes the whole system. This index helps quantify that risk.
Chemistry: The paper mentions "molecular structures." In chemistry, atoms are connected by bonds of varying strengths. This index could help predict how a molecule behaves based on how uneven its connections are.

The Bottom Line

Duaa Abdullah took a classic math tool (the Sigma Index) and upgraded it for the real world (Fuzzy Graphs). They created a new ruler to measure inequality in networks where connections have different strengths.

They proved that:

Perfect equality = Zero score.
Extreme inequality (one strong link, everyone else alone) = Maximum score.
Combining networks follows predictable rules.

It's a new way to look at the world, acknowledging that not all connections are created equal, and measuring just how unequal they really are.

1. Problem Statement

The paper addresses a gap in fuzzy graph theory regarding the quantification of structural irregularity. While the Sigma index (defined as the population variance of a degree sequence) is a well-established topological index for crisp (ordinary) graphs, it had not been systematically extended to fuzzy graphs.

The core research question is: How can the sigma index be appropriately extended to fuzzy graphs?
In crisp graphs, the sigma index $\sigma(\Gamma)$ measures irregularity and equals zero if and only if the graph is regular. In the fuzzy context, where vertex and edge memberships are values in $[0, 1]$ , the authors aim to define a "Fuzzy Sigma Index" ( $\sigma^*$ ) that captures the variance of fuzzy degrees and analyze its properties, bounds, and behavior under graph operations.

2. Methodology and Definitions

The authors rigorously extend the classical definition of the Sigma index to the fuzzy domain using the following framework:

Fuzzy Graph Definition: A fuzzy graph $\Gamma = (V, \nu, \mu)$ consists of a vertex set $V$ , a fuzzy subset $\nu: V \to [0, 1]$ , and a symmetric fuzzy relation $\mu: V \times V \to [0, 1]$ such that $\mu(u, v) \leq \min(\nu(u), \nu(v))$ .
Fuzzy Degree ( $d_\Gamma(v)$ ): Defined as the sum of membership values of edges incident to vertex $v$ :
$d_\Gamma(v) = \sum_{u \neq v} \mu(v, u)$
Fuzzy Size ( $\tilde{w}$ ): The total weight of all edges in the graph:
$\tilde{w}(\Gamma) = \sum_{u < v} \mu(u, v)$
Fuzzy Sigma Index ( $\sigma^*(\Gamma)$ ): Defined as the population variance of the fuzzy degree sequence. Let $n = |V|$ and $\lambda = \frac{2\tilde{w}}{n}$ be the average fuzzy degree. The index is:
$\sigma^*(\Gamma) = \frac{1}{n} \sum_{v \in V} \left( d_\Gamma(v) - \lambda \right)^2$

The methodology involves deriving mathematical properties, establishing sharp bounds, analyzing extremal graphs (those maximizing or minimizing the index), and investigating the index's behavior under standard fuzzy graph operations (Union, Join, Cartesian Product, and Composition).

3. Key Contributions and Results

A. Fundamental Properties

Zero Irregularity: The paper proves that $\sigma^*(\Gamma) = 0$ if and only if $\Gamma$ is a fuzzy-regular graph (i.e., all vertices have the same fuzzy degree).
Complement Graphs: The authors establish a relationship between a fuzzy graph and its complement. If the vertex membership function $\nu(v) = 1$ for all $v$ , the sum of the sigma indices of the graph and its complement is bounded, providing a benchmark for measuring total irregularity in complementary structures.

B. Extremal Characterization

Minimum Value: As noted, the minimum value is 0, achieved by fuzzy-regular graphs.
Maximum Value (Sharp Upper Bound): The paper derives a sharp upper bound for $\sigma^*(\Gamma)$ in terms of the fuzzy size $\tilde{w}$ and the number of vertices $n$ :
$\sigma^*(\Gamma) \leq \frac{2\tilde{w}^2}{n} \left( 1 - \frac{2}{n} \right)$
Extremal Structure: The maximum value is attained if and only if the graph consists of exactly one fuzzy edge with weight $\tilde{w}$ connecting two vertices, while all other vertices are isolated. This contrasts with fuzzy star graphs, which yield strictly smaller values.

C. Bounds Based on Degree Range

The paper provides bounds based on the maximum degree ( $\Delta$ ) and minimum degree ( $\delta$ ):

Upper Bound: $\sigma^*(\Gamma) \leq \frac{2n + (\Delta - \delta)^2}{4}$ (derived via variance properties).
Lower Bound for Non-Regular Graphs: For non-regular fuzzy graphs, a positive lower bound is established:
$\sigma^*(\Gamma) \geq \frac{1}{n^2}(\Delta - \delta)^2$

D. Behavior Under Graph Operations

The study analyzes how $\sigma^*$ changes under various operations:

Union ( $\Gamma_1 \cup \Gamma_2$ ): The index of the union depends on the individual indices and the difference in their average degrees.
Join ( $\Gamma_1 \vee \Gamma_2$ ): The degrees in the join operation are modified by adding the minimum membership values of the other graph's vertices.
Cartesian Product ( $\Gamma_1 \square \Gamma_2$ ): A significant result is the additivity of the index:
$\sigma^*(\Gamma_1 \square \Gamma_2) = \sigma^*(\Gamma_1) + \sigma^*(\Gamma_2)$
This implies that the irregularity of the product graph is simply the sum of the irregularities of its components.
Composition (Lexicographic Product): The irregularity of the composition $\Gamma_1[\Gamma_2]$ is primarily driven by the irregularity of the outer graph $\Gamma_1$ , especially when the number of vertices in $\Gamma_2$ is large.

4. Significance and Applications

Theoretical Foundation: This work fills a critical void in fuzzy graph theory by providing the first systematic treatment of variance-based topological indices. It moves beyond edge-sum indices to degree-variance indices.
Structural Analysis: The fuzzy sigma index offers a precise metric for quantifying structural irregularity in networks where connections have varying strengths (e.g., social networks with varying trust levels, biological networks with varying interaction strengths).
Extremal Graph Theory: By characterizing the graphs that maximize and minimize the index, the paper provides tools for designing networks with specific regularity or irregularity properties.
Future Directions: The paper suggests extending these concepts to weighted fuzzy graphs and exploring correlations with other fuzzy topological indices for applications in fuzzy network analysis and molecular structure modeling.

Conclusion

Duaa Abdullah's paper successfully defines the Fuzzy Sigma Index as a robust measure of irregularity in fuzzy graphs. Through rigorous mathematical derivation, the author establishes that the index is zero for regular fuzzy graphs and maximized by single-edge graphs. The discovery of the additive property for Cartesian products and the derivation of sharp bounds provide a comprehensive toolkit for analyzing the structural complexity of fuzzy networks.