نتایج جستجو برای: irredundance number
تعداد نتایج: 1168378 فیلتر نتایج به سال:
Let 7(G) denote the minimum cardinality of a dominating set of a graph G = (V,E). A longstanding upper bound for 7(G) is attributed to Berge: For any graph G with n vertices and maximum degree A(G), 7(G) <~ n A(G). We eharacterise connected bipartite graphs which achieve this upper bound. For an arbitrary graph G we furnish two conditions which are necessary if 7(G) + A(G) = n and are sufficien...
The lower and the upper irredundance numbers of a graph G, denoted ir(G) and IR(G), respectively, are conceptually linked to domination and independence numbers and have numerous relations to other graph parameters. It has been an open question whether determining these numbers for a graphG on n vertices admits exact algorithms running in time faster than the trivial Θ(2 · poly(n)) enumeration,...
A dominating set of an oriented graph D is a set S of vertices of D such that every vertex not in S is a successor of some vertex of S. The minimum cardinality of a dominating set of D, denoted γ(D), is the domination number of D. An irredundant set of an oriented graph D is a set S of vertices of D such that every vertex of S has a private successor, that is, for all x ∈ S, |O[x]− O[S − x]| ≥ ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید