Radial Radio Sequences of Perfect Matching-deleted and Minimum Edge Covering-deleted Subgraphs of the Complete Graph K n
Vimalajenifer Selvaraj · American Journal of Applied Mathematics · 2026
Graph labeling is an important and rapidly developing area in graph theory due to its numerous applications in communication networks, frequency assignment, channel allocation, and coding theory. Among the various labeling methods, radial radio labeling has gained attention because of its connection with distance-based constraints and graph structure. In this paper, we study the radial radio labeling of certain connected subgraphs derived from complete graphs. We introduce the concepts of radial radio number and radial radio sequence and examine their behavior for specific graph classes obtained from complete graphs through edge deletions. The main objective of this work is to determine the radial radio sequence of connected graphs formed by deleting a perfect matching and an edge covering from the complete graph. Using fundamental graph-theoretic techniques and structural analysis, we derive exact values for the radial radio sequence of these graph families. The obtained results provide insight into the influence of graph structure and neighborhood properties on radial radio labeling. This study extends existing research on distance-based graph labeling and contributes to a better understanding of how structural modifications in graphs affect labeling parameters, which may further support applications in communication network optimization and interference reduction problems.