Results 121 to 130 of about 9,176,317 (295)

Domination in graphs with few edges [PDF]

open access: yes, 1995
summary:The domination number $\g(G)$ of a graph $G$ and two its variants are considered, namely the signed domination number $\g_s (G)$ and the minus domination number $\g^-(G)$. These numerical invariants are compared for graphs in which the degrees of
Zelinka, Bohdan
core   +1 more source

Artificial molecular machines and motors—Design and control of nanoscale motion

open access: yesFEBS Letters, EarlyView.
Molecules are constantly moving because of thermal fluctuations, but random motion alone cannot be exploited to perform directional tasks. Artificial molecular machines use chemical, electrical, or light energy to bias this motion. Molecular shuttles, rotary motors, and supramolecular pumps illustrate how nanoscale movement can be controlled and ...
Leonardo Andreoni, Alberto Credi
wiley   +1 more source

Rainbow game domination subdivision number of a graph [PDF]

open access: yesRomanian Journal of Mathematics and Computer Science, 2014
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  

The heterodimeric amino acid transporters (HAT) of the SLC7/SLC3 family: A structure−function relationships and relevance to human pathology

open access: yesFEBS Letters, EarlyView.
Heterodimeric amino acid transporters consist of SLC7 and SLC3 family proteins arranged in a conserved structural organization. They regulate nutrient transport across cell membranes, supporting essential cellular functions. These transporters also contribute to xenobiotic/drug uptake and distribution.
Mariafrancesca Scalise   +5 more
wiley   +1 more source

Restrained captive domination number

open access: yesOpen Engineering
The restrained captive domination number (RCDN), denoted by γRca(G),{\gamma }_{{\rm{Rca}}}(G), is a new definition of domination number in graphs introduced in this article.
Alrikabi Zainab Yasir   +2 more
doaj   +1 more source

The Italian bondage and reinforcement numbers of digraphs

open access: yesElectronic Journal of Graph Theory and Applications
An Italian dominating function on a digraph D with vertex set V(D) is defined as a function f : V(D) → {0, 1, 2} such that every vertex v ∈ V(D) with f(v) = 0 has at least two in-neighbors assigned 1 under f or one in-neighbor w with f(w) = 2. The weight 
Kijung Kim
doaj   +1 more source

Unique Metro Domination Number of Circulant Graphs [PDF]

open access: yes, 2019
In this paper, we determine unique metro domination number of circulant ...
John Sherra, B. Sooryanarayana
core   +1 more source

Leucine‐rich glioma inactivated 1 (LGI1) is a ganglioside‐binding protein

open access: yesFEBS Letters, EarlyView.
Neuronal hyperexcitability associated with a decrease/absence of the extracellular protein LGI1 has been suggested to be primarily due to the downregulation of Kv1 channel expression. The molecular mechanisms underlying this decrease have not yet been elucidated.
Kévin Debreux   +7 more
wiley   +1 more source

A dynamic domination problem in trees [PDF]

open access: yesTransactions on Combinatorics, 2015
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  

Home - About - Disclaimer - Privacy