This paper introduces “Alarm Webs”, a pioneering framework designed to decode the dynamics of Radio Access Network (RAN) alarms, utilizing a novel graph-theoretic approach. Leveraging directed graphs (digraphs), this work uniquely encodes RAN alarm data, with each alarm represented as a node and its severity indicated by distinct colors. The edges of these graphs signify the sequence of alarms, creating a directional flow from one alarm to the next. Utilizing a comprehensive dataset from a major telecommunications service provider in the UK, encompassing alarms from 4G and 5G networks across over 7,000 base stations, the framework ofers an unprecedented analysis of alarm patterns and interactions. The proposed methodology involves the calculation of in-degrees and out-degrees for each node, identifying those with in-degrees higher than four as significant indicators of commonly resulting alarms. This threshold-based selection is instrumental in isolating the most impactful alarms. Additionally, the application of Sankey diagrams brings an intuitive visualization of alarm causality, based on the in-degree centrality of the nodes. This approach not only clarifies the complex interrelationships among alarms but also aids in identifying potential cascading issues within the network. By effectively mapping alarm sequences and identifying key alarms, this framework paves the way for enhanced network reliability and proactive maintenance strategies in the ever-evolving telecommunications landscape.