Results 51 to 60 of about 30,248 (245)

Underlying Graphs of 3-Quasi-Transitive Digraphs and 3-Transitive Digraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2013
A digraph is 3-quasi-transitive (resp. 3-transitive), if for any path x0x1 x2x3 of length 3, x0 and x3 are adjacent (resp. x0 dominates x3). C´esar Hern´andez-Cruz conjectured that if D is a 3-quasi-transitive digraph, then the underlying graph of D, UG ...
Wang Ruixia, Wang Shiying
doaj   +1 more source

On the cognitive nature of verb transitivity in English [PDF]

open access: yesSHS Web of Conferences
The traditional view of the transitivity of a verb as its ability to have a direct complement in the accusative case does not reflect the core essence of this verb characteristic.
Gulevich Tatiana
doaj   +1 more source

Indirect Comparison of Neoadjuvant Treatment Strategies for Muscle‐Invasive Bladder Cancer: ddMVAC and Perioperative Durvalumab‐Gemcitabine‐Cisplatin Versus Gemcitabine‐Cisplatin: A Systematic Review and Network Meta‐Analysis of Randomised Controlled Trials

open access: yesInternational Journal of Cancer, EarlyView.
Optimizing neoadjuvant therapy for muscle‐invasive bladder cancer patients who are eligible for cisplatin remains difficult, owing particularly to high toxicity and recurrence rates. This meta‐analysis compared dose‐dense methotrexate, vinblastine, doxorubicin, and cisplatin (ddMVAC) against durvalumab plus gemcitabine‐cisplatin (D‐GC) and GC alone ...
Maurin Helen Mangold   +12 more
wiley   +1 more source

On Local Aspects of Topological Transitivity and Weak Mixing in Set-Valued Discrete Systems

open access: yesDiscrete Dynamics in Nature and Society, 2013
Blanchard and Huang introduced the notion of weakly mixing subset, and Oprocha and Zhang gave the concept of transitive subset and studied its basic properties. In this paper our main goal is to discuss the weakly mixing subsets and transitive subsets in
Lei Liu
doaj   +1 more source

Transitive $t$-designs and strongly regular graphs constructed from linear groups $L(2,q)$‎, ‎$q leq 23$ [PDF]

open access: yesInternational Journal of Group Theory, 2019
‎In this paper we construct transitive $t$-designs from the linear groups $L(2,q)‎, ‎q leq 23$‎. ‎Thereby we classify $t$-designs‎, ‎$t ge 2$‎, ‎admitting a transitive action of the linear groups $L(2,q)‎, ‎q leq 23$‎, ‎up to 35 points and obtained ...
Dean Crnković, Andrea Švob
doaj   +1 more source

The structure of transitive ordered permutation groups [PDF]

open access: yes, 1999
summary:We give some necessary and sufficient conditions for transitive $l$-permutation groups to be $2$-transitive. We also discuss primitive components and give necessary and sufficient conditions for transitive $l$-permutation groups to be normal ...
Zhenyu, Huang, Zhu, Zuo-Tong,
core   +1 more source

Transitive Nonlocal Games

open access: yes, 2023
We study a class of nonlocal games, called transitive games, for which the set of perfect strategies forms a semigroup. We establish several interesting correspondences of bisynchronous transitive games with the theory of compact quantum groups.
Prakash, Jitendra   +3 more
core   +1 more source

Signed Projective Cubes, a Homomorphism Point of View

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen   +2 more
wiley   +1 more source

Solving distant analogies reduces belief-based responding in transitive inference

open access: yes, 2019
Previous research demonstrated that relational processing in transitive inference problems can be disrupted by belief-based content. Given the premises, The horse is larger than the goat, and The goat is larger than the elephant, accepting the valid ...
Vann, Damian M, Andrews, Glenda
core   +1 more source

A Coarse Geometric Approach to Graph Layout Problems

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy