نتایج جستجو برای: twin minus domination in digraphs
تعداد نتایج: 16986047 فیلتر نتایج به سال:
I. Introduction In this paper, D=(V, A) is a finite, directed graph with neither loops nor multiple arcs (but pairs of opposite arcs are allowed) and G=(V, E) is a finite, undirected graph with neither loops nor multiple edges. For basic terminology, we refer to Chartrand and Lesniak [2]. A set S of vertices in a graph G=(V, E) is a dominating set if every vertex in V – S is adjacent to some ve...
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V − S is adjacent to at least one vertex in S. Domination in graphs is a well-studied branch of graph theory, and is the subject of two books by Haynes, Hedetniemi and Slater [8, 9]. However, about 90% of the papers on domination have considered only undirected graphs. Thus, relatively little is known abo...
A two-valued function f defined on the vertices of a graph G = (V,E), f : V → {−1, 1}, is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. That is, for every v ∈ V, f(N(v)) ≥ 1, where N(v) consists of every vertex adjacent to v. The weight of a total signed dominating function is f(V ) = ∑ f(v), over all vertices v ∈ V . The total ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید