Results 11 to 20 of about 1,106 (97)
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 normalized distance Laplacian
Special Matrices, 2021 The distance matrix 𝒟(G) of a connected graph G is the matrix containing the pairwise distances between vertices. The transmission of a vertex vi in G is the sum of the distances from vi to all other vertices and T(G) is the diagonal matrix of ...
Reinhart Carolyn
doaj +1 more source
On kernels by rainbow paths in arc-coloured digraphs
Open Mathematics, 2021 In 2018, Bai, Fujita and Zhang [Discrete Math. 341 (2018), no. 6, 1523–1533] introduced the concept of a kernel by rainbow paths (for short, RP-kernel) of an arc-coloured digraph DD, which is a subset SS of vertices of DD such that (aa) there exists no ...
Li Ruijuan, Cao Yanqin, Zhang Xinhong
doaj +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
On the diameter of the Kronecker product graph [PDF]
, 2012 Let $G_1$ and $G_2$ be two undirected nontrivial graphs. The Kronecker product of $G_1$ and $G_2$ denoted by $G_1\otimes G_2$ with vertex set $V(G_1)\times V(G_2)$, two vertices $x_1x_2$ and $y_1y_2$ are adjacent if and only if $(x_1,y_1)\in E(G_1)$ and $
Hu, Fu-Tao, Xu, Jun-Ming
core +2 more sources
Some improved bounds on two energy-like invariants of some derived graphs
Open Mathematics, 2019 Given a simple graph G, its Laplacian-energy-like invariant LEL(G) and incidence energy IE(G) are the sum of square root of its all Laplacian eigenvalues and signless Laplacian eigenvalues, respectively. This paper obtains some improved bounds on LEL and
Cui Shu-Yu, Tian Gui-Xian
doaj +1 more source
On the general position number of two classes of graphs
Open Mathematics, 2022 The general position problem is to find the cardinality of the largest vertex subset SS such that no triple of vertices of SS lies on a common geodesic.
Yao Yan, He Mengya, Ji Shengjin
doaj +1 more source
The Armendariz Graph of a Ring
Discussiones Mathematicae - General Algebra and Applications, 2018 In this paper we initiate the study of Armendariz graph of a commutative ring R and investigate the basic properties of this graph such as diameter, girth, domination number, etc.
Abdioğlu Cihat +2 more
doaj +1 more source
On Antipodal and Diametrical Partial Cubes
Discussiones Mathematicae Graph Theory, 2021 We prove that any diametrical partial cube of diameter at most 6 is antipodal. Because any antipodal graph is harmonic, this gives a partial answer to a question of Fukuda and Handa [Antipodal graphs and oriented matroids, Discrete Math.
Polat Norbert
doaj +1 more source