THE MINIMAL DOMINATING SETS IN A DIRECTED GRAPH AND THE KEY INDICATORS SET OF SOCIO–ECONOMIC SYSTEM
From MaRDI portal
Publication:6081707
DOI10.15826/umj.2023.1.014zbMath1522.05167MaRDI QIDQ6081707
Vladimir Vladimirovich Voroshilov, R. Yu. Simanchev, I. V. Urazova
Publication date: 5 October 2023
Published in: Ural Mathematical Journal (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/umj196
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Integer programming (90C10) Linear programming (90C05) Mathematical economics (91B99) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- On the computational complexity of upper fractional domination
- Contributions to the theory of domination, independence and irredundance in graphs
- Chordal graphs and upper irredundance, upper domination and independence
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper Domination: Complexity and Approximation
- Unnamed Item
