歌曲
发表于 2025-3-26 22:52:06
Signed and Minus Dominating Functions in Graphs,tion .. The . -domination number of a graph . is the minimum weight of a . -dominating function of .. When . = {0, 1}, {−1, 1}, or {−1, 0, 1}, we obtain the standard, signed, or minus domination numbers, respectively. In this chapter we survey the main results and open problems on signed and minus domination and their generalizations.
fertilizer
发表于 2025-3-27 05:05:44
Rainbow Domination in Graphs, weight of a .-rainbow dominating function of . is called the .-rainbow domination number, ..(.), of .. Equivalently, the .-rainbow domination number of a graph . is the domination number of the Cartesian product of . with the complete graph ... In this chapter, we survey main results on rainbow domination and related concepts in graphs.
代替
发表于 2025-3-27 07:29:09
Global Domination, An important special case is when . is the complete graph with two factors, a subgraph . and its complement .. Representative results are presented, including those where the graphs are restricted to certain classes or the type of global domination is altered similar to what has occurred with standard domination.
Harrowing
发表于 2025-3-27 11:59:36
http://reply.papertrans.cn/93/9262/926152/926152_34.png
gonioscopy
发表于 2025-3-27 15:28:52
Restrained and Total Restrained Domination in Graphs,The restrained domination number of ., denoted by ..(.), is the smallest cardinality of a restrained dominating set of .. A total restrained dominating set is a set . such that every vertex . ∈ . is adjacent to a vertex in . and every vertex of . − . is adjacent to a vertex in . − .. The total restr
太空
发表于 2025-3-27 19:01:52
http://reply.papertrans.cn/93/9262/926152/926152_36.png