Strong domination number of a modified graph

MaRDI QIDQ6419481zbMATH OpenFDO

Authors Saeid Alikhani, N. Ghanbari

Publication date 4 December 2022

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: Let $G=(V,E)$ be a simple graph. A set $DsubseteqV$ is a strong dominating set of $G$, if for every vertex $xinVsetminusD$ there is a vertex $yinD$ with $xyinE(G)$ and $deg(x)leqdeg(y)$. The strong domination number $gamm{a}_{st}(G)$ is defined as the minimum cardinality of a strong dominating set. In this paper, we study the effects on $gamm{a}_{st}(G)$ when $G$ is modified by operations on vertex and edge of $G$.

This page was built for publication: Strong domination number of a modified graph

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