20.500.12556/DiRROS-24935 Graph coloring based on degree-dominance property Graphs are widely used to model complex systems in social, biological, and technological domains. Motivated by the need to incorporate hierarchical influence within such networks, this study introduces domination coloring, a new coloring framework based on degree–domination. In a graph G = (V,E), each vertex v has degree d(v), and a vertex x is said to dominate an adjacent vertex y if d(x) > d(y). Under domination coloring, adjacent vertices must receive different colors whenever one dominates the other. This work establishes the theoretical foundations of domination coloring, proves essential structural properties, proposes efficient algorithms, and discusses potential applications in network analysis and decision-making environments. graph domination coloring chromatic number degree graph theory graf dominiranje barvanje kromatično število stopnja teorija grafov true false true Korean Institute of Intelligent Systems Angleški jezik Slovenski jezik Neznano 2025-12-30 03:43:33 2026-05-27 08:47:54 2026-05-28 03:48:18 0000-00-00 00:00:00 2025 0 0 Nasl. z nasl. zaslona; Opis vira z dne 29. 12. 2025; Soavtorji: Sukumar Mondal, Leo Mršić, and Sovan Samanta; str. 406-415 no. 4 Vol. 25 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2025-12-25 519.17 2093-744X 10.5391/IJFIS.2025.25.4.406 263117827 https://www.ijfis.org/journal/view.html?volume=25&number=4&spage=406&vmd=Full 1 56239a31-e529-11f0-94a7-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=37341 RAZ_Maity_Ananta_2025.pdf RAZ_Maity_Ananta_2025.pdf 1 6445BFE5D1CE760FA6E1A59B2A783F17 009573367768c785efcba83f9becd6454ed7431ec9c710d798ad282a11b58d47 c28e003b-5997-11f1-8e51-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=44351 Rudolfovo – Znanstveno in tehnološko središče Novo mesto 0 0 0