Convex and isometric domination of (weak) dominating pair graphs
نویسندگان
چکیده
منابع مشابه
Convex and isometric domination of (weak) dominating pair graphs
A set D of vertices in a graph G is a dominating set if every vertex of G, which is not in D, has a neighbor in D. A set of vertices D in G is convex (respectively, isometric), if all vertices in all shortest paths (respectively, all vertices in one of the shortest paths) between any two vertices in D lie in D. The problem of finding a minimum convex dominating (respectively, isometric dominati...
متن کاملAcyclic Weak Convex Domination in Graphs
In a graph G = (V, E), a set D ⊂ V is a weak convex dominating(WCD) set if each vertex of V-D is adjacent to at least one vertex in D and d < D > (u, v) = d G (u, v) for any two vertices u, v in D. A weak convex dominating set D, whose induced graph < D > has no cycle is called acyclic weak convex dominating(AWCD) set. The domination number γ ac (G) is the smallest order of a acyclic weak conve...
متن کاملWeak signed Roman k-domination in graphs
Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...
متن کاملWeak signed Roman domination in graphs
A {em weak signed Roman dominating function} (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as afunction $f:V(G)rightarrow{-1,1,2}$ having the property that $sum_{xin N[v]}f(x)ge 1$ for each $vin V(G)$, where $N[v]$ is theclosed neighborhood of $v$. The weight of a WSRDF is the sum of its function values over all vertices.The weak signed Roman domination number of $G...
متن کاملHereditary dominating pair graphs
An asteroidal triple (AT) is a set of vertices such that each pair of vertices is joined by a path that avoids the neighborhood of the third. Every AT-free graph contains a dominating pair, a pair of vertices such that for every path between them, every vertex of the graph is within distance one of the path. We say that a graph is a hereditary dominating pair (HDP) graph if each of its connecte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2018.03.023