Results 11 to 20 of about 1,116 (99)
Veterinary Dermatology, Volume 34, Issue 3, Page 235-245, June 2023., 2023 Background – Oral and parenteral drug delivery in horses can be difficult. Equine‐specific transdermal drug formulations offer improved ease of treatment; development of such formulations requires a deeper understanding of the structural and chemical tissue barrier of horse skin. Hypothesis/Objectives – To compare the structural composition and barrier
Samuel C. Bizley +3 more
wiley +1 more source
Veterinary 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
The (1, 2)-step competition graph of a hypertournament
Open Mathematics, 2021 In 2011, Factor and Merz [Discrete Appl. Math. 159 (2011), 100–103] defined the (1,2)\left(1,2)-step competition graph of a digraph. Given a digraph D=(V,A)D=\left(V,A), the (1,2)\left(1,2)-step competition graph of D, denoted C1,2(D){C}_{1,2}\left(D ...
Li Ruijuan, An Xiaoting, Zhang Xinhong
doaj +1 more source
Proof of a conjecture of Graham and Lov\'asz concerning unimodality of coefficients of the distance characteristic polynomial of a tree [PDF]
, 2017 We establish a conjecture of Graham and Lov\'asz that the (normalized) coefficients of the distance characteristic polynomial of a tree are unimodal; we also prove they are log ...
Aalipour, Ghodratollah +7 more
core +4 more sources
Steiner distance matrix of caterpillar graphs
Special Matrices, 2022 In this article, we show that the rank of the 2-Steiner distance matrix of a caterpillar graph having NN vertices and pp pendant veritices is 2N−p−12N-p-1.
Azimi Ali +2 more
doaj +1 more source
Subgroups of arbitrary even ordinary depth
, 2020 We show that for each positive integer $n$, there are a group $G$ and a subgroup $H$ such that the ordinary depth is $d(H, G) = 2n$. This solves the open problem posed by Lars Kadison whether even ordinary depth larger than $6$ can occur.Comment: 9 pages;
Breuer, Thomas +2 more
core +1 more source
The Forcing Weak Edge Detour Number of a Graph [PDF]
, 2010 The forcing weak edge detour numbers of certain classes of graphs are ...
Athisayanathan, S., Santhakumaran, A.P.
core +1 more source
Vertices with the Second Neighborhood Property in Eulerian Digraphs
, 2014 The Second Neighborhood Conjecture states that every simple digraph has a vertex whose second out-neighborhood is at least as large as its first out-neighborhood, i.e. a vertex with the Second Neighborhood Property.
Dong-Lan Luo (608306) +8 more
core +4 more sources
Functional centrality in graphs [PDF]
, 2006 In this paper we introduce the functional centrality as a generalization of the subgraph centrality. We propose a general method for characterizing nodes in the graph according to the number of closed walks starting and ending at the node.
A. Gutiérrez +5 more
core +2 more sources
Graphs that are Critical for the Packing Chromatic Number
Discussiones Mathematicae Graph Theory, 2022 Given a graph G, a coloring c : V (G) → {1, …, k} such that c(u) = c(v) = i implies that vertices u and v are at distance greater than i, is called a packing coloring of G.
Brešar Boštjan, Ferme Jasmina
doaj +1 more source