Chromatic and Connectivity Approaches to Fractional Domination in Graphs

Abstract

In this study, we go deeper into the concept of fractional domination in graph theory by investigating its links to chromatic numbers and the connectivity between graphs. We explore these bounds on fractional domination by investigating Theorems that determine explanations and provide insights for optimal control/monitoring in complex networks We note that Theorems 1, 2 and 3 provide novel insights for the relationships of fractional domination, chromatic numbers and graph connectivity which are useful features for network analysis and optimization. Through the investigation of these theorem this research contributes a step towards the development of graph theory and its applications in various fields.