Domination in graphoidally covered graphs: Least-kernel graphoidal graphs-II
نویسندگان
چکیده
منابع مشابه
Further Results on Domination in Graphoidally Covered Graphs
In any graph G = (V,E) that is not necessarily finite, a graphoidal cover is a set ψ of nontrivial paths P1, P2, . . . , not necessarily open and called ψ -edges, such that (GC-1) no vertex of G is an internal vertex of more than one path in ψ, and (GC-2) every edge of G is in exactly one of the paths in ψ. A ψ -dominating set of G is then defined as a set D of vertices in G such that every ver...
متن کاملTotal domination in $K_r$-covered graphs
The inflation $G_{I}$ of a graph $G$ with $n(G)$ vertices and $m(G)$ edges is obtained from $G$ by replacing every vertex of degree $d$ of $G$ by a clique, which is isomorph to the complete graph $K_{d}$, and each edge $(x_{i},x_{j})$ of $G$ is replaced by an edge $(u,v)$ in such a way that $uin X_{i}$, $vin X_{j}$, and two different edges of $G$ are replaced by non-adjacent edges of $G_{I}$. T...
متن کاملtotal domination in $k_r$-covered graphs
the inflation $g_{i}$ of a graph $g$ with $n(g)$ vertices and $m(g)$ edges is obtained from $g$ by replacing every vertex of degree $d$ of $g$ by a clique, which is isomorph to the complete graph $k_{d}$, and each edge $(x_{i},x_{j})$ of $g$ is replaced by an edge $(u,v)$ in such a way that $uin x_{i}$, $vin x_{j}$, and two different edges of $g$ are replaced by non-adjacent edges of $g_{i}$. t...
متن کاملTotal domination in Kr-covered graphs
The inflation GI of a graph G with n(G) vertices and m(G) edges is obtained from G by replacing every vertex of degree d of G by a clique, which is isomorphic to the complete graph Kd, and each edge (xi, xj) of G is replaced by an edge (u, v) in such a way that u ∈ Xi, v ∈ Xj , and two different edges of G are replaced by non-adjacent edges of GI . The total domination number γt(G) of a graph G...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2018
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2018.01.002