Results 31 to 40 of about 122 (75)

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

On the Clean Graph of Commutative Artinian Rings

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.
For a commutative Artinian ring R with unity, the clean graph Cl(R) is a graph with vertices in the form of an ordered pair (e, u), where e is an idempotent and u is a unit of ring R, respectively. Two distinct vertices (e, u) and (f, v) are adjacent in Cl(R) if and only if ef = fe = 0 or uv = vu = 1.
R. Singh   +3 more
wiley   +1 more source

The rigidity of a partially triangulated torus

open access: yesProceedings of the London Mathematical Society, Volume 118, Issue 5, Page 1277-1304, May 2019., 2019
Abstract A simple graph is 3‐rigid if its generic embeddings in R3 are infinitesimally rigid. Necessary and sufficient conditions are obtained for the minimal 3‐rigidity of a simple graph obtained from a triangulated torus by the deletion of edges interior to an embedded triangulated disc.
J. Cruickshank, D. Kitson, S. C. Power
wiley   +1 more source

2-closures of primitive permutation groups of holomorph type

open access: yesOpen Mathematics, 2019
The 2-closure G(2) of a permutation group G on a finite set Ω is the largest subgroup of Sym(Ω) which has the same orbits as G in the induced action on Ω × Ω.
Yu Xue, Pan Jiangmin
doaj   +1 more source

On 7-valent symmetric graphs of order 2pq and 11-valent symmetric graphs of order 4pq

open access: yesOpen Mathematics, 2022
A graph is said to be symmetric if its automorphism group is transitive on its arcs. This article is one of a series of articles devoted to characterizing prime-valent arc-transitive graphs of square-free order or twice square-free order. In this article,
Ling Bo, Lan Ting, Ding Suyun
doaj   +1 more source

Wiener and Additive Degree‐Based Topological Indices of Linear Functional Graphs Over Finite‐Dimensional Vector Spaces

open access: yesJournal of Applied Mathematics, Volume 2025, Issue 1, 2025.
This article explores numerous significant additive topological indices based on degrees for linear functional graphs over finite‐dimensional vector spaces. Specifically, we derive some unique topological indices, such as the eccentricity‐based indices and the Wiener index.
Vinnarasi L.   +4 more
wiley   +1 more source

Finite groups with star-free noncyclic graphs

open access: yesOpen Mathematics, 2019
For a finite noncyclic group G, let Cyc(G) be the set of elements a of G such that 〈a, b〉 is cyclic for each b of G. The noncyclic graph of G is a graph with the vertex set G ∖ Cyc(G), having an edge between two distinct vertices x and y if 〈x, y〉 is not
Ma Xuanlong, Walls Gary L., Wang Kaishun
doaj   +1 more source

Ideal‐Based Quasi Cozero Divisor Graph of a Commutative Ring

open access: yesJournal of Mathematics, Volume 2025, Issue 1, 2025.
Let R be a commutative ring with identity and I be an ideal of R. The zero‐divisor graph of R with respect to I, denoted by ΓI(R), is the graph whose vertices are the set {x ∈ R∖I |xy ∈ I for some y ∈ R∖I} with distinct vertices x and y are adjacent if and only if xy ∈ I.
Faranak Farshadifar, Huadong Su
wiley   +1 more source

Simplicial complexes defined on groups

open access: yesOpen Mathematics
This study makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group, which are preserved by automorphisms of the group, and in many
Cameron Peter J.
doaj   +1 more source

End-regular and End-orthodox generalized lexicographic products of bipartite graphs

open access: yesOpen Mathematics, 2016
A graph X is said to be End-regular (End-orthodox) if its endomorphism monoid End(X) is a regular (orthodox) semigroup. In this paper, we determine the End-regular and the End-orthodox generalized lexicographic products of bipartite graphs.
Gu Rui, Hou Hailong
doaj   +1 more source

Home - About - Disclaimer - Privacy