Results 51 to 60 of about 896 (158)
A Multivariate Approach for Checking Resiliency in Access Control [PDF]
In recent years, several combinatorial problems were introduced in the area of access control. Typically, such problems deal with an authorization policy, seen as a relation $UR \subseteq U \times R$, where $(u, r) \in UR$ means that user $u$ is ...
A Frank +10 more
core +2 more sources
A graph of order is domatically perfect if , where and denote the domination number and the domatic number, respectively. In this paper, we give basic results for domatically perfect graphs, and study a main problem; for a given graph , to find a ...
Naoki Matsumoto
doaj +1 more source
A dominating set of a graph \(G=(V,E)\) is a subset \(D\) of \(V\) such that every vertex not in \(D\) is adjacent to some vertex in \(D\). The domatic number of \(G\) is the maximum positive integer \(k\) such that \(V\) can be partioned into \(k\) pairwise disjoint dominating sets. It was proved that the problem of determining the domatic number of a
openaire +1 more source
Introduction to coalitions in graphs
A coalition in a graph consists of two disjoint sets of vertices V1 and V2, neither of which is a dominating set but whose union is a dominating set. A coalition partition in a graph G of order is a vertex partition such that every set Vi of π either is ...
Teresa W. Haynes +4 more
doaj +1 more source
A land plant‐specific VPS13 mediates polarized vesicle trafficking in germinating pollen
Summary Pollen has an extraordinary ability to convert from a dry state to an extremely rapidly growing state. During pollination, pollen receives water and Ca2+ from the contacting pistil, which will be a directional cue for pollen tube germination. The subsequent rapid activation of directional vesicular transport must support the pollen tube growth,
Surachat Tangpranomkorn +8 more
wiley +1 more source
Cubic Graphs with Total Domatic Number at Least Two
Let G be a graph with no isolated vertex. A total dominating set of G is a set S of vertices of G such that every vertex is adjacent to at least one vertex in S.
Akbari Saieed +3 more
doaj +1 more source
Double Roman domination and domatic numbers of graphs
A double Roman dominating function on a graph $G$ with vertex set $V(G)$ is defined in \cite{bhh} as a function $f:V(G)\rightarrow\{0,1,2,3\}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least two neighbors assigned 2 ...
L. Volkmann
doaj +1 more source
On Existential MSO and its Relation to ETH [PDF]
Impagliazzo et al. proposed a framework, based on the logic fragment defining the complexity class SNP, to identify problems that are equivalent to k-CNF-Sat modulo subexponential-time reducibility (serf-reducibility). The subexponential-time solvability
de Haan, Ronald +3 more
core +1 more source
Selection of an Optimal Warehouses Using Global Regular Domination in Graphs
Let G = (V, E) be a simple graph. A subset S of V (G) is said to be global dominating set if S is a dominating set of the given graph G and its complement G. A subset whose induced subgraph is regular in G is also regular in G. A dominating set D of V (G) is called a regular dominating set if hSi is regular. In this article, we introduce global regular
R. Sundareswaran +6 more
wiley +1 more source
Truncation of the dihydroquinazolinone scaffold produced analogues with potent antimalarial activity against the asexual blood and transmission stages of the malaria parasite's lifecycle by targeting PfATP4. Enhancing the metabolic stability and aqueous solubility remains a challenge to achieve curative efficacy in a mouse model to demonstrate the ...
Trent D. Ashton +23 more
wiley +1 more source

