Results 51 to 60 of about 269 (132)
Veterinary Dermatology, Volume 36, Issue 6, Page 825-837, December 2025.Background: Inhibition of the Janus kinase pathway is an established treatment for allergic dermatitis. Objective: To evaluate the efficacy and safety of ilunocitinib for control of pruritus in dogs with allergic dermatitis in a randomised, double‐masked clinical trial.
Sophie Forster +5 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2018 A total-colored graph G is rainbow total-connected if any two vertices of G are connected by a path whose edges and internal vertices have distinct colors.
Sun Yuefang, Jin Zemin, Tu Jianhua
doaj +1 more source
A Study on Variants of Status Unequal Coloring in Graphs and Its Properties
Journal of Mathematics, Volume 2024, Issue 1, 2024.Let G∧ be a simple connected graph with vertex set ϑG∧ and edge set ξG∧. The status of a vertex p∈ϑG∧ is defined as ∑q≠pd(p, q). A subset P of ϑG∧ is called a status unequal dominating set (stu‐dominating set) of G∧; for every q∈ϑ−P, there exists p in P such that p and q are adjacent and st(p) ≠ st(q).
Parvathy Gnana Sambandam +4 more
wiley +1 more source
Pair L(2, 1)-Labelings of Infinite Graphs
Discussiones Mathematicae Graph Theory, 2019 An L(2, 1)-labeling of a graph G = (V,E) is an assignment of nonnegative integers to V such that two adjacent vertices must receive numbers (labels) at least two apart and further, if two vertices are in distance 2 then they receive distinct labels. This
Yeh Roger K.
doaj +1 more source
Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs
, 1998 We show that computing (and even approximating) MAXIMUM CLIQUE and MINIMUM GRAPH COLORING for circulant graphs is essentially as hard as in the general case.
Ivan Gerace +5 more
core +1 more source
Global Dominator Coloring of Graphs
Discussiones Mathematicae Graph Theory, 2019 Let S ⊆ V. A vertex v ∈ V is a dominator of S if v dominates every vertex in S and v is said to be an anti-dominator of S if v dominates none of the vertices of S. Let 𝒞 = (V1, V2, . . ., Vk) be a coloring of G and let v ∈ V (G).
Hamid Ismail Sahul, Rajeswari Malairaj
doaj +1 more source
On parsimonious edge-colouring of graphs with maximum degree three
, 2013 Revised version submitted to Graphs and CombinatoricsInternational audienceIn a graph $G$ of maximum degree $\Delta$ let $\gamma$ denote the largest fraction of edges that can be $\Delta$ edge-coloured.
Fouquet, Jean-Luc, Vanherpe, Jean-Marie
core +1 more source
Integer decomposition for polyhedra defined by nearly totally unimodular matrices [PDF]
, 2005 . We call a matrix $A$ nearly totally unimodular if it can be obtained from a totally unimodular matrix $\tilde{A}$ by adding to each row of $\tilde{A}$ an integer multiple of some fixed row $a^{\transp}$ of $\tilde{A}$.
Gijswijt, D.C., Gijswijt, D. (Dion)
core +1 more source
On θ-commutators and the corresponding non-commuting graphs
Open Mathematics, 2017 The θ-commutators of elements of a group with respect to an automorphism are introduced and their properties are investigated. Also, corresponding to θ-commutators, we define the θ-non-commuting graphs of groups and study their correlations with other ...
Shalchi S., Erfanian A., Farrokhi DG M.
doaj +1 more source
Irreducible No-Hole L(2, 1)-Coloring of Edge-Multiplicity-Paths-Replacement Graph
Discussiones Mathematicae Graph Theory, 2018 An L(2, 1)-coloring (or labeling) of a simple connected graph G is a mapping f : V (G) → Z+ ∪ {0} such that |f(u)−f(v)| ≥ 2 for all edges uv of G, and |f(u) − f(v)| ≥ 1 if u and v are at distance two in G.
Mandal Nibedita, Panigrahi Pratima
doaj +1 more source