Results 11 to 20 of about 197 (101)
Background Antimicrobial resistance in Staphylococcus pseudintermedius (SP) and the prevalence of meticillin‐resistant SP (MRSP) is increasing in dogs worldwide. Objectives To evaluate the influence of hospital size on antimicrobial resistance of SP and whether restricted use of antimicrobials based on antibiograms could reduce the identification of ...
Keita Iyori +5 more
wiley +1 more source
Decomposing tournaments into paths
Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo +3 more
wiley +1 more source
ON CONNECTEDNESS AND COMPLETENESS OF CAYLEY DIGRAPHS OF TRANSFORMATION SEMIGROUPS WITH FIXED SETS
Let Fix(X,Y ) be a semigroup of full transformations on a set X in which elements in a nonempty subset Y of X are fixed. In this paper, we construct the Cayley digraphs of Fix(X,Y ) and study some structural properties of such digraphs such as the ...
Nuttawoot Nupo, Chollawat Pookpienlert
semanticscholar +1 more source
Filling cages. Reverse mathematics and combinatorial principles
prepared by Gianluca Basso. E-mail: gianluca.basso@protonmail.com URL: http://people.unil.ch/gianlucabasso Marta Fiori Carones, Filling cages. Reverse mathematics and combinatorial principles, University of Udine, Italy. 2020.
Marta Fiori Carones
semanticscholar +1 more source
Measurable combinatorics and orbit equivalence relations
prepared by Gianluca Basso. E-mail: gianluca.basso@protonmail.com URL: http://people.unil.ch/gianlucabasso Marta Fiori Carones, Filling cages. Reverse mathematics and combinatorial principles, University of Udine, Italy. 2020.
Tomasz Cieśla
semanticscholar +1 more source
Block digraph of a directed graph
Let D be a connected digraph of order n (n ≥ 3) and let B(D) = {B1, B2, . . . , BN} be a set of blocks of D. The block digraph Q = B(D) has vertex set V (Q) = B(D) and arc set A(Q) = BiBj : Bi, Bj ∈ V (Q), Bi, Bj have a cut-vertex of D in common and ...
H. M. Nagesh +2 more
semanticscholar +1 more source
Connectedness of a suborbital graph for congruence subgroups
In this paper, we give necessary and sufficient conditions for the graph Hu,n to be connected and a forest.MSC:20H10, 20H05, 05C05, 05C20.
Yavuz Kesicioğlu +2 more
semanticscholar +2 more sources
Minimally Strong Subgraph (k,ℓ)-Arc-Connected Digraphs
Let D = (V,A) be a digraph of order n, S a subset of V of size k and 2 ≤ k ≤ n. A subdigraph H of D is called an S-strong subgraph if H is strong and S ⊆ V (H). Two S-strong subgraphs D1 and D2 are said to be arc-disjoint if A(D1) ∩ A(D2) = ∅.
Sun Yuefang, Jin Zemin
doaj +1 more source
The Second Neighbourhood for Bipartite Tournaments
Let T (X ∪ Y, A) be a bipartite tournament with partite sets X, Y and arc set A. For any vertex x ∈ X ∪Y, the second out-neighbourhood N++(x) of x is the set of all vertices with distance 2 from x.
Li Ruijuan, Sheng Bin
doaj +1 more source
The {−2,−1}-Selfdual and Decomposable Tournaments
We only consider finite tournaments. The dual of a tournament is obtained by reversing all the arcs. A tournament is selfdual if it is isomorphic to its dual.
Boudabbous Youssef, Ille Pierre
doaj +1 more source

