نتایج جستجو برای: twin minus domination in digraphs
تعداد نتایج: 16986047 فیلتر نتایج به سال:
Let D = (V,A) be a finite and simple digraph. A II-rainbow dominating function (2RDF) of a digraph D is a function f from the vertex set V to the set of all subsets of the set {1, 2} such that for any vertex v ∈ V with f(v) = ∅ the condition ⋃ u∈N−(v) f(u) = {1, 2} is fulfilled, where N−(v) is the set of in-neighbors of v. The weight of a 2RDF f is the value ω(f) = ∑ v∈V |f(v)|. The 2-rainbow d...
We use the domination number of a parametrized random digraph family called proportional-edge proximity catch digraphs (PCDs) for testing multivariate spatial point patterns. This digraph family is based on relative positions of data points from various classes. We extend the results on the distribution of the domination number of proportional-edge PCDs, and use the domination number as a stati...
Given two graphs G1 and G2, the Kronecker product G1 ⊗G2 of G1 and G2 is a graph which has vertex set V (G1⊗G2) = V (G1)×V (G2) and edge set E(G1 ⊗ G2) = {(u1, v1)(u2, v2) : u1u2 ∈ E(G1) and v1v2 ∈ E(G2)}. ∗ Research was partially supported by the National Nature Science Foundation of China (No. 11171207) and the Key Programs of Wuxi City College of Vocational Technology (WXCY2012-GZ-007). † Co...
This paper introduces a notion of a random threshold directed graph, extending the work of Reilly and Scheinerman in the undirected case and closely related to random Ferrers digraphs. We begin by presenting the main definition: D is a threshold digraph provided we can find a pair of weighting functions f, g : V (D)→ R such that for distinct v, w ∈ V (D) we have v → w iff f(v) + g(w) > 1. We al...
Unlike graphs, digraphs or binary relational structures, the 2-structures do not define precise links between vertices. They only yield an equivalence between links. Also 2-structures provide a suitable generalization in the framework of clan decomposition. Let σ be a 2-structure. A subset C of V (σ) is a clan of σ if for each v ∈ V (σ) ∖ C, v is linked in the same way to all the elements of C....
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
The orientable domination number, DOM(G), of a graph G is the largest number over all orientations G. In this paper, DOM studied on different product graphs and related operations. arbitrary corona products determined, while sharp lower upper bounds are proved for Cartesian lexicographic products. A result Chartrand et al. (1996) extended by establishing values DOM(Kn1,n2,n3) positive integers ...
For the terminology and notations not defined here, we adopt those in Bondy and Murty [1] and Xu [2] and consider simple graphs only. Let G = (V,E) be a graph with vertex set V = V (G) and edge set E = E(G). For any vertex v ∈ V , NG(v) denotes the open neighborhood of v in G and NG[v] = NG(v) ∪ {v} the closed one. dG(v) = |NG(v)| is called the degree of v in G, ∆ and δ denote the maximum degre...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید