Results 51 to 60 of about 197 (156)

Efficacy and field safety of ilunocitinib for the control of atopic dermatitis in client‐owned dogs: A multicentre, double‐masked, randomised, placebo‐controlled clinical trial

open access: yesVeterinary Dermatology, Volume 36, Issue 5, Page 647-659, October 2025.
Background – Inhibition of the Janus kinase (JAK) pathway is a well‐established option for canine atopic dermatitis (cAD). Objective – To evaluate the efficacy and safety of ilunocitinib, a novel JAK inhibitor for the control of pruritus and skin lesions in client‐owned dogs with cAD.
Sophie Forster   +5 more
wiley   +1 more source

The Modified Schultz Index of Trees [PDF]

open access: yes, 2010
For a graph G = (V, E), the modified Schultz index of G is defined as the degree of the vertex u of G, and d G (u, v) is the distance between u and v.
Shubo Chen, Weijun Liu
core  

Some remarks on the Dirichlet problem on infinite trees

open access: yesConcrete Operators, 2019
We consider the Dirichlet problem on in_nite and locally _nite rooted trees, andwe prove that the set of irregular points for continuous data has zero capacity. We also give some uniqueness results for solutions in Sobolev W1,p of the tree.
Chalmoukis Nikolaos, Levi Matteo
doaj   +1 more source

Investigation of microbial contamination of commercial Romanowsky stain variant solutions used in veterinary clinics

open access: yesVeterinary Dermatology, Volume 36, Issue 5, Page 613-620, October 2025.
Abstract Background Diff‐Quik (DQ) staining is widely used in clinical practice for its ease of use and rapid results. However, its potential contamination remains a concern. Hypothesis/Objectives This study aimed to investigate DQ solution contamination in veterinary hospitals and identify factors affecting it through a questionnaire on stain usage ...
Minji Cho, Seulgi Bae
wiley   +1 more source

The Minimum Size of a Graph with Given Tree Connectivity

open access: yesDiscussiones Mathematicae Graph Theory, 2021
For a graph G = (V, E) and a set S ⊆ V of at least two vertices, an S-tree is a such subgraph T of G that is a tree with S ⊆ V (T). Two S-trees T1 and T2 are said to be internally disjoint if E(T1) ∩ E(T2) = ∅ and V (T1) ∩ V (T2) = S, and edge-disjoint ...
Sun Yuefang, Sheng Bin, Jin Zemin
doaj   +1 more source

Evaluation of filaggrin 2 expression in dogs with atopic dermatitis before and after oclacitinib maleate administration

open access: yesVeterinary Dermatology, Volume 36, Issue 4, Page 453-461, August 2025.
Background – Canine atopic dermatitis (cAD) is a chronic, inflammatory, multifactorial and pruritic disease. The presence of skin barrier impairment (e.g. filaggrin alterations), along with abnormal immune responses, can negatively impact cutaneous barrier function.
Wendie Roldan Villalobos   +5 more
wiley   +1 more source

The Eccentric Connectivity Index of Dendrimers [PDF]

open access: yes, 2010
If G is a connected graph with vertex set V , then the eccentric connectivity index of G, ξ C (G), is defined as is the degree of a vertex v and ecc(v) is its eccentricity.
Jianguang Yang, Fangli Xia
core  

GA2 index of some graph operations

open access: yes, 2010
Let G = (V, E) be a graph. For e = uv ? E(G), nu (e) is the number of vertices of G lying closer to u than to v and nv (e) is the number of vertices of G lying closer to v than u. The GA2 index of G is defined as ?uv?E(G) 2?
G.H. Fath-Tabar   +2 more
core   +1 more source

Harmonic‐Arithmetic Index: Lower Bound for n‐Order Trees With Fixed Number of Pendant Vertices and Monogenic Semigroup for Graph Operations

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.
Graph theory combined with chemistry provides a strong framework for modeling and assessing chemical compounds. By representing molecules as graphs and applying topological indices, chemists can gain profound insights into the physical and chemical characteristics of compounds.
Kalpana R.   +2 more
wiley   +1 more source

Further results on permanents of Laplacian matrices of trees

open access: yesOpen Mathematics
The research on the permanents of graph matrices is one of the contemporary research topic in algebraic combinatorics. Brualdi and Goldwasser characterized the upper and lower bounds of permanents of Laplacian matrices of trees.
Wu Tingzeng, Dong Xiangshuai
doaj   +1 more source

Home - About - Disclaimer - Privacy