On graphs for which the connected domination number is at most the total domination number
نویسندگان
چکیده
منابع مشابه
On the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملTotal Roman domination subdivision number in graphs
A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...
متن کاملThe edge domination number of connected graphs
A subset X of edges in a graph G is called an edge dominating set of G if every edge not in X is adjacent to some edge in X. The edge domination number γ′(G) of G is the minimum cardinality taken over all edge dominating sets of G. Let m,n and k be positive integers with n − 1 ≤ m ≤ (n 2 ) , G(m,n) be the set of all non-isomorphic connected graphs of order n and size m, and G(m,n; k) = {G ∈ G(m...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.12.025