A continuous generalization of domination-like invariants

Michitaka Furuya ()
Additional contact information
Michitaka Furuya: Kitasato University

Journal of Combinatorial Optimization, 2021, vol. 41, issue 4, No 8, 905-922

Abstract: Abstract In this paper, we define a new domination-like invariant of graphs. Let $${\mathbb {R}}^{+}$$ R + be the set of non-negative numbers. Let $$c\in {\mathbb {R}}^{+}-\{0\}$$ c ∈ R + - { 0 } be a number, and let G be a graph. A function $$f:V(G)\rightarrow {\mathbb {R}}^{+}$$ f : V ( G ) → R + is a c-self-dominating function of G if for every $$u\in V(G)$$ u ∈ V ( G ) , $$f(u)\ge c$$ f ( u ) ≥ c or $$\max \{f(v):v\in N_{G}(u)\}\ge 1$$ max { f ( v ) : v ∈ N G ( u ) } ≥ 1 . The c-self-domination number $$\gamma ^{c}(G)$$ γ c ( G ) of G is defined as $$\gamma ^{c}(G):=\min \{\sum _{u\in V(G)}f(u):f$$ γ c ( G ) : = min { ∑ u ∈ V ( G ) f ( u ) : f is a c-self-dominating function of $$G\}$$ G } . Then $$\gamma ^{1}(G)$$ γ 1 ( G ) , $$\gamma ^{\infty }(G)$$ γ ∞ ( G ) and $$\gamma ^{\frac{1}{2}}(G)$$ γ 1 2 ( G ) are equal to the domination number, the total domination number and the half of the Roman domination number of G, respectively. Our main aim is to continuously fill in the gaps among such three invariants. In this paper, we give a sharp upper bound of the c-self-domination number for all $$c\ge \frac{1}{2}$$ c ≥ 1 2 .

Keywords: Self-domination; Domination; Total domination; Roman domination; 05C69 (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00725-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:41:y:2021:i:4:d:10.1007_s10878-021-00725-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00725-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().