Dominator Sum Coloring in Triangular Snake Graphs Optimization Approach using Algorithms and Python Implementation

Dominator coloring is an important area of graph theory with applications and coloring methods often overlook the dominance relationships between vertex color classes, leading to inefficiencies. This paper introduces dominator sum coloring, a novel hybrid approach combining dominator coloring and su...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2025 3rd International Conference on Sustainable Computing and Data Communication Systems (ICSCDS) s. 620 - 627
Hlavní autoři: Veeraragavan, Indhumathi, Arul, Sharmila Mary
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 06.08.2025
Témata:
chromatic number
chromatic sum
Color
Dominator coloring
dominator sum coloring
Graph Coloring
Minimization
Network Optimization
Network topology
Optimization
Processor scheduling
Python Algorithms
Resource management
Resource Scheduling
Scheduling
Social networking (online)
sum coloring
Topology
Wireless networks
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Dominator coloring is an important area of graph theory with applications and coloring methods often overlook the dominance relationships between vertex color classes, leading to inefficiencies. This paper introduces dominator sum coloring, a novel hybrid approach combining dominator coloring and sum coloring to address these inefficiencies. The goal of this study is to assign labels to vertices that minimize the sum of labels while ensuring each vertex dominates at least one-color class, thereby reducing the number of color classes needed. We apply dominator sum coloring to triangular snake graph families, including triangular snake T n , double triangular snake DT n , triple triangular snake TT n . Through algorithmic techniques, we compute the dominator sum chromatic number, χ ds (G) and the chromatic sum S ds (G) graph. for these graphs. Our results show that the dominator sum chromatic number significantly reduces the number of color classes required compared to traditional dominator coloring. Additionally, the chromatic sum is minimized, leading to a more efficient allocation of vertex labels. This paper compares dominator sum coloring within dominator coloring methods, focusing on computational efficiency and real-world applications. The proposed approach outperforms conventional methods in terms of both computational complexity and optimization. It offers an efficient solution for managing dominance relationships in graphs, with practical applications in wireless network design, social network analysis, and resource allocation, where optimizing dominance can improve overall performance.
DOI:10.1109/ICSCDS65426.2025.11167092