Zobrazeno 1 - 10
of 7 222
pro vyhledávání: '"Domination in graphs"'
Autor:
Emadi, Azam Sadat, Masoumi, Iman
Let $G=(V,E)$ be a simple graph of order $n$. A Majority Roman Dominating Function (MRDF) on a graph G is a function $f: V\rightarrow\{-1, +1, 2\}$ if the sum of its function values over at least half the closed neighborhoods is at least one , this i
Externí odkaz:
http://arxiv.org/abs/2411.07266
This monograph is designed to be an in-depth introduction to domination in graphs. It focuses on three core concepts: domination, total domination, and independent domination. It contains major results on these foundational domination numbers, inclu
Autor:
Lenzen, Christoph, Wenning, Sophie
A long-standing open question is which graph class is the most general one permitting constant-time constant-factor approximations for dominating sets. The approximation ratio has been bounded by increasingly general parameters such as genus, arboric
Externí odkaz:
http://arxiv.org/abs/2408.12998
Autor:
Kuzman, Bostjan
A $d$-regular graph $X$ is called $d$-rainbow domination regular or $d$-RDR, if its $d$-rainbow domination number $\gamma_{rd}(X)$ attains the lower bound $n/2$ for $d$-regular graphs, where $n$ is the number of vertices. In the paper, two combinator
Externí odkaz:
http://arxiv.org/abs/2410.10662