generation property
Recently Published Documents


TOTAL DOCUMENTS

30
(FIVE YEARS 3)

H-INDEX

7
(FIVE YEARS 0)

Author(s):  
Taku Okada ◽  
Shun Fujieda ◽  
Shuichiro Hashi ◽  
Kazushi Ishiyama ◽  
Shigeru Suzuki ◽  
...  

Nanoscale ◽  
2021 ◽  
Author(s):  
Weiwei Wu ◽  
Yan Yang ◽  
Zhuoying Liang ◽  
Xiling Song ◽  
Yadong Huang ◽  
...  

Recently, alkyl radical has attracted much attention in cancer therapy due to its oxygen-independent generation property. For the first time, alkyl radical and nitric oxide (NO) combined therapy is demonstrated...


Author(s):  
Daniel Horsley ◽  
Moharram Iradmusa ◽  
Cheryl E Praeger

Abstract A set $\mathcal{S}$ of derangements (fixed-point-free permutations) of a set V generates a digraph with vertex set V and arcs $(x,x^{\,\sigma})$ for x ∈ V and $\sigma\in\mathcal{S}$. We address the problem of characterizing those infinite (simple loopless) digraphs which are generated by finite sets of derangements. The case of finite digraphs was addressed in an earlier work by the second and third authors. A criterion is given for derangement generation which resembles the criterion given by De Bruijn and Erdős for vertex colourings of graphs in that the property for an infinite digraph is determined by properties of its finite sub-digraphs. The derangement generation property for a digraph is linked with the existence of a finite 1-factor cover for an associated bipartite (undirected) graph.


2019 ◽  
Vol 44 (41) ◽  
pp. 23267-23276 ◽  
Author(s):  
Yan Wang ◽  
Wei Meng ◽  
Dan Wang ◽  
Zhongrui Wang ◽  
Kailu Zou ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document