Norah Almalki

collaborators

2 papers

math.CO2019

Structural Properties of Connected Domination Critical Graphs

Pawaton Kaemawichanurat

A graph $G$ is said to be $k$ - $γ_{c}$ -critical if the connected domination number $γ_{c} (G)$ is equal to $k$ and $γ_{c} (G + uv) < k$ for any pair of non-adjacent vertices $u$ and $…

math.CO2019

Inequalities of Independence Number, Clique Number and Connectivity of Maximal Connected Domination Critical Graphs

Norah Almalki, Pawaton Kaemawichanurat

A $k$ - $γ_{c}$ -edge critical graph is a graph $G$ with the connected domination number $γ_{c} (G) = k$ and $γ_{c} (G + uv) < k$ for every $uv \in E (G)$ . Further, a $2$ -conn…