Results 111 to 120 of about 9,423,140 (336)
Rainbow game domination subdivision number of a graph [PDF]
The rainbow game domination subdivision number of a graph G is defined by the following game. Two players D and A, D playing first, alternately mark or subdivide an edge of G which is not yet marked nor subdivided.
J. Amjadi
doaj
Fair Domination Number in Cactus Graphs
For k ≥ 1, a k-fair dominating set (or just kFD-set) in a graph G is a dominating set S such that |N(v) ∩ S| = k for every vertex v ∈ V \ S. The k-fair domination number of G, denoted by fdk(G), is the minimum cardinality of a kFD-set.
Majid Hajian, N. J. Rad
semanticscholar +1 more source
Presurgery 72‐h fasting in GB patients leads to adaptations of plasma lipids and polar metabolites. Fasting reduces lysophosphatidylcholines and increases free fatty acids, shifts triglycerides toward long‐chain TGs and increases branched‐chain amino acids, alpha aminobutyric acid, and uric acid.
Iris Divé+7 more
wiley +1 more source
Computing locating-total domination number in some rotationally symmetric graphs. [PDF]
Raza H, Iqbal N, Khan H, Botmart T.
europepmc +1 more source
Trees with equal domination and tree-free domination numbers
AbstractThe tree-free domination number γ(G;−Tk), k⩾2, of a graph G is the minimum cardinality of a dominating set S in G such that the subgraph 〈S〉 induced by S contains no tree on k vertices as a (not necessarily induced) subgraph (equivalently, each component of 〈S〉 has cardinality less than k).
Haynes, Teresa W., Henning, Michael A.
openaire +3 more sources
Transcriptome‐wide analysis of circRNA and RBP profiles and their molecular relevance for GBM
CircRNAs are differentially expressed in glioblastoma primary tumors and might serve as therapeutic targets and diagnostic markers. The investigation of circRNA and RNA‐binding proteins (RBPs) interactions shows that distinct RBPs play a role in circRNA biogenesis and function.
Julia Latowska‐Łysiak+14 more
wiley +1 more source
The Slater and Sub-k-Domination Number of a Graph with Applications to Domination and k-Domination
In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph G, called the sub-k-domination number and denoted subk(G).
Amos David+3 more
doaj +1 more source
Bounding the Locating-Total Domination Number of a Tree in Terms of Its Annihilation Number
Suppose G = (V,E) is a graph with no isolated vertex. A subset S of V is called a locating-total dominating set of G if every vertex in V is adjacent to a vertex in S, and for every pair of distinct vertices u and v in V −S, we have N(u) ∩ S ≠ N(v) ∩ S ...
Mei Lu, Wenjie Ning, Kun Wang
semanticscholar +1 more source
Combining melting curve analysis enhances the multiplexing capability of digital PCR. Here, we developed a 14‐plex assay to simultaneously measure single nucleotide mutations and amplifications of KRAS and GNAS, which are common driver genes in pancreatic cancer precursors. This assay accurately quantified variant allele frequencies in clinical samples
Junko Tanaka+10 more
wiley +1 more source
A dynamic domination problem in trees [PDF]
We consider a dynamic domination problem for graphs in which an infinite sequence of attacks occur at vertices with guards and the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex with no guard. Other guards
William Klostermeyer, Christina Mynhardt
doaj