Results 11 to 20 of about 1,360 (113)

Evaluation of the effects of chlorhexidine digluconate with and without cBD103 or cCath against multidrug‐resistant clinical isolates of Staphylococcus pseudintermedius

open access: yesVeterinary Dermatology, Volume 33, Issue 1, Page 17-e6, February 2022., 2022
Background – Because of the increased incidence of multidrug‐resistant (MDR) bacteria, the use of disinfectants over antibiotics has been encouraged. However, the interactions between disinfectants and host local immunity are poorly understood. Objective – To assess the effects of chlorhexidine digluconate (Chx), with and without selected host defence ...
Domenico Santoro   +3 more
wiley   +1 more source

Influence of hospital size on antimicrobial resistance and advantages of restricting antimicrobial use based on cumulative antibiograms in dogs with Staphylococcus pseudintermedius infections in Japan

open access: yesVeterinary Dermatology, Volume 32, Issue 6, Page 668-e178, December 2021., 2021
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

A new obstruction for normal spanning trees

open access: yesBulletin of the London Mathematical Society, Volume 53, Issue 4, Page 1220-1227, August 2021., 2021
Abstract In a paper from 2001 (Journal of the LMS), Diestel and Leader offered a proof that a connected graph has a normal spanning tree if and only if it has no minor obtained canonically from either an (ℵ0,ℵ1)‐regular bipartite graph or an order‐theoretic Aronszajn tree. In particular, this refuted an earlier conjecture of Halin's that only the first
Max Pitz
wiley   +1 more source

Branch-Weight Unique Trees

open access: yesDiscussiones Mathematicae Graph Theory, 2022
A branch at a vertex x in a tree is a maximal subtree containing x as an endvertex. The branch-weight of x is the maximum number of edges in any branch at x.
Shang Jen-Ling
doaj   +1 more source

A correction on Shiloach's algorithm for minimum linear arrangement of trees [PDF]

open access: yes, 2017
More than 30 years ago, Shiloach published an algorithm to solve the minimum linear arrangement problem for undirected trees. Here we fix a small error in the original version of the algorithm and discuss its effect on subsequent literature.
Esteban, Juan Luis   +1 more
core   +3 more sources

Efficacy and safety of 0.0584% hydrocortisone aceponate topical spray and systemic oclacitinib combination therapy in dogs with atopic dermatitis: a randomized, double‐blinded, placebo‐controlled trial

open access: yesVeterinary Dermatology, Volume 32, Issue 2, Page 119-e25, April 2021., 2021
Background – Oclacitinib is an effective systemic therapy for dogs with atopic dermatitis (AD). Few studies have evaluated concurrent topical treatment with oclacitinib in dogs. Objectives – To evaluate the efficacy and safety of combination therapy of oclacitinib and 0.0584% hydrocortisone aceponate (HCA) spray in dogs with AD.
Junko Takahashi   +9 more
wiley   +1 more source

Total Roman {2}-Dominating Functions in Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2022
A Roman {2}-dominating function (R2F) is a function f : V → {0, 1, 2} with the property that for every vertex v ∈ V with f(v) = 0 there is a neighbor u of v with f(u) = 2, or there are two neighbors x, y of v with f(x) = f(y) = 1.
Ahangar H. Abdollahzadeh   +3 more
doaj   +1 more source

Saturation Spectrum of Paths and Stars

open access: yesDiscussiones Mathematicae Graph Theory, 2017
A graph G is H-saturated if H is not a subgraph of G but the addition of any edge from G̅ to G results in a copy of H. The minimum size of an H-saturated graph on n vertices is denoted sat(n,H), while the maximum size is the well studied extremal number,
Faudree Jill   +4 more
doaj   +1 more source

The bipartite Laplacian matrix of a nonsingular tree

open access: yesSpecial Matrices, 2023
For a bipartite graph, the complete adjacency matrix is not necessary to display its adjacency information. In 1985, Godsil used a smaller size matrix to represent this, known as the bipartite adjacency matrix.
Bapat Ravindra B.   +2 more
doaj   +1 more source

Lower bounds for bootstrap percolation on Galton-Watson trees [PDF]

open access: yes, 2014
Bootstrap percolation is a cellular automaton modelling the spread of an `infection' on a graph. In this note, we prove a family of lower bounds on the critical probability for $r$-neighbour bootstrap percolation on Galton--Watson trees in terms of ...
Gunderson, Karen, Przykucki, Michał
core   +2 more sources

Home - About - Disclaimer - Privacy