Results 31 to 40 of about 1,217,256 (282)
The Detour Domination and Connected Detour Domination values of a graph
Ratio Mathematica, 2022 The number of -sets that belongs to in G is defined as the detour domination value of indicated by for each vertex . In this article, we examined at the concept of a graph’s detour domination value.
R.V Revathi, M Antony
doaj +1 more source
Inequalities involving independence domination, $f$-domination, connected and total $f$-domination numbers [PDF]
, 1978 summary:Let $f$ be an integer-valued function defined on the vertex set $V(G)$ of a graph $G$. A subset $D$ of $V(G)$ is an $f$-dominating set if each vertex $x$ outside $D$ is adjacent to at least $f(x)$ vertices in $D$.
Allan, Robert B. +7 more
core +1 more source
Outer-weakly convex domination number of graphs [PDF]
Communications in Combinatorics and Optimization, 2020 For a given simple graph $G=(V,E)$, a set $S\subseteq V$ is an outer-weakly convex dominating set if every vertex in $V\setminus S$ is adjacent to some vertex in $S$ and $V\setminus S$ is a weakly convex set.
Jonecis A. Dayap +2 more
doaj +1 more source
Perfect Domination Excellent Trees [PDF]
, 2012 A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to exactly one vertex in D. In this paper we introduce the concept of perfect domination excellent graph as a graph in which every vertex belongs to some ...
Sharada, B., Sharada B.
core +1 more source
Weakly connected domination subdivision numbers [PDF]
, 2008 A set D of vertices in a graph G = (V,E) is a weakly connected dominating set of G if D is dominating in G and the subgraph weakly induced by D is connected.
Raczek, Joanna
core +1 more source
Structural Properties of Connected Domination Critical Graphs
Mathematics, 2021 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)
Norah Almalki, Pawaton Kaemawichanurat
doaj +1 more source
Connected Domination Polynomial of Graphs
Fasciculi Mathematici, 2018 Abstract Let G be a simple graph of order n. The connected domination polynomial of G is the polynomial $D_c \left( {G,x} \right) = \sum\nolimits_{i = \gamma _c \left( G \right)}^{\left| {V\left( G \right)} \right|} {d_c \left( {G,i} \right)x^i }$ , where dc(G,i) is the number of connected dominating sets of G of size i and γc(G) is the connected ...
Mojdeh, D. A., Emadi, A. S.
openaire +2 more sources
Computation of Various Domination Numbers of Rolf Nevanlinna (RNP) Collaboration Graph
Brazilian Archives of Biology and Technology, 2017 In this paper, we compute various Domination numbers like Outer Connected Domination (OCD), Doubly Connected Domination (DCD), Fair Domination (FD), Independence Domination (ID), 2-Packing (2-P) for Rolf Nevanlinna Prize Winners's Collaboration Graph ...
Yegnanarayanan V, Logeshwary B
doaj +1 more source
Perfect edge domination in vague graphs
Ratio Mathematica, 2021 In this paper, we modified undirected vague graphs and edge domination set based on these two concepts. We study the notions of perfect edge domination, connected perfect edge domination of vague graph. Moreover, we investigate some related properties in
M Kaliraja, P Kanibose, Abdul Ibrahim
doaj +1 more source
Neighbourhood total domination in graphs [PDF]
Opuscula Mathematica, 2011 Let \(G = (V,E)\) be a graph without isolated vertices. A dominating set \(S\) of \(G\) is called a neighbourhood total dominating set (ntd-set) if the induced subgraph \(\langle N(S)\rangle\) has no isolated vertices.
S. Arumugam, C. Sivagnanam
doaj +1 more source