نتایج جستجو برای: dominating set
تعداد نتایج: 666360 فیلتر نتایج به سال:
For a simple graph $G$ with vertex set $V(G)=\{v_1,...,v_n\}$, we define the closed neighborhood of $u$ as \\$N[u]=\{v \in V(G) \; | v \text{is adjacent to} u \text{or} v=u \}$ and matrix $N(G)$ whose $i$th column is characteristic vector $N[v_i]$. We say $S$ odd dominating if $N[u]\cap S$ for all $u\in V(G)$. prove that parity cardinality an equal to rank $G$, where defined dimension space $N(...
A mixed dominating set is a collection of vertices and edges that dominates all graph. We study the complexity exact parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions. In particular, we settle problem's by treewidth pathwidth giving an algorithm running in time $O^*(5^{tw})$ (improving current best $O^*(6^{tw})$), as well lower bound showing our cannot be...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید