Co-even domination number of some binary operations on graphs

MaRDI QIDQ6382003zbMATH OpenFDO

Authors N. Ghanbari

Publication date 2 November 2021

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Abstract: Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $DsubseteqV$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$. The cardinality of a smallest dominating set of $G$, denoted by $gamma(G)$, is the domination number of $G$. A dominating set $D$ is called co-even dominating set if the degree of vertex $v$ is even number for all $vinV-D$. The cardinality of a smallest co-even dominating set of $G$, denoted by $gamm{a}_{coe}(G)$, is the co-even domination number of $G$. In this paper, we study the co-even domination number of some binary operations on graphs.

This page was built for publication: Co-even domination number of some binary operations on graphs

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