English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

A graph $G$ is said to be $k$-$\gamma_{c}$-critical if the connecteddomination number $\gamma_{c}(G) = k$ and $\gamma_{c}(G + uv) < k$ for every$uv \in E(\overline{G})$. Let $\delta, \kappa$ and $\alpha$ be respectively theminimum degree, the connectivity and the independence number. In this paper, weshow that a $3$-$\gamma_{c}$-critical graph $G$ satisfies $\alpha \leq \kappa +2$. Moreover, if $\kappa \geq 3$, then $\alpha = \kappa + p$ if and only if$\alpha = \delta + p$ for all $p \in \{1, 2\}$. We show that the condition$\kappa + 1 \leq \alpha \leq \kappa + 2$ is best possible to prove that $\kappa= \delta$. By these result, we conclude our paper with an open problem onHamiltonian connected of $3$-$\gamma_{c}$-critical graphs.

Independence and Connectivity of Connected Domination Critical Graphs