Neutrosophic Average Edge Connectivity with Applications to Communication Networks
Average edge connectivity is a fundamental concept in graph theory, widely employed to evaluate the robustness of networks through the analysis of local edge cuts. Classical fuzzy extensions allow for graded membership, yet they fail to clearly distinguish between inherent uncertainty and definite absence of edges. To overcome this limitation, we introduce the notion of neutrosophic average edge connectivity, a tri-valued connectivity measure formulated within the framework of single-valued neutrosophic graphs (SVNGs). In this study, we rigorously define neutrosophic local edge cuts, establish key theoretical results including bounds and monotonicity properties, and design efficient algorithms tailored for particular families of graphs. The applicability of the proposed framework is demonstrated through a detailed communication-network case study, which highlights its capacity to capture structural resilience under indeterminate conditions. Overall, the proposed approach generalizes classical robustness indicators and provides a comprehensive tool for analyzing connectivity in networks characterized by vagueness, indeterminacy, and incomplete information.
Volume & Issue
Vol. Volume 27 / Iss. Issue 2