Small domination-type invariants in random graphs

DOI10.4310/JOC.2022.V13.N4.A4MaRDI QIDQ2166390zbMATH OpenOpenAlexFDO

Authors Michitaka Furuya, Tamae Kawasaki

Publication date 24 August 2022

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.11743

random graph differential domination number Roman domination number self domination number

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: For

c i n m a t h b b R^{+} c u p i n f t y

and a graph

G

, a function

f : V (G) i g h t a r r o w 0, 1, c

is called a

c

-self dominating function of

G

if for every vertex

u i n V (G)

,

f (u) g e q c

or

m a x f (v) : v i n N_{G} (u) g e q 1

where

N_{G} (u)

is the neighborhood of

u

in

G

. The minimum weight

w (f) = s u m_{u i n V (G)} f (u)

of a

c

-self dominating function

f

of

G

is called the

c

-self domination number of

G

. The

c

-self domination concept is a common generalization of three domination-type invariants; (original) domination, total domination and Roman domination. In this paper, we study a behavior of the

c

-self domination number in random graphs for small

c

.

Recommendations

Cited in

(1)

A continuous generalization of domination-like invariants

This page was built for publication: Small domination-type invariants in random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2166390)