AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
Fundamental properties of the resilient domination number are established and corresponding bounds and explicit formulas for the resilient domination number are obtained.
Let $G = (V(G), E(G))$ be a nontrivial connected graph. A subset $S\subseteq V(G)$ is called an outer-connected weakly connected 2-dominating set in $G$ if every vertex $v \in V(G)\setminus S$ is adjacent to at least two vertices in $S$, the subgraph $\langle S \rangle_w$ weakly induced by $S$ is connected, and the ind...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.