Results 21 to 30 of about 2,306 (105)
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
Veterinary 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
Cospectral Pairs of Regular Graphs with Different Connectivity
Discussiones Mathematicae Graph Theory, 2020 For vertex- and edge-connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.
Haemers Willem H.
doaj +1 more source
On the Eccentric Spectra of the Line Graph of Starlike Trees
Discrete Dynamics in Nature and Society, Volume 2025, Issue 1, 2025.A tree is called starlike if it has exactly one vertex with a degree greater than two. In this paper, we determine the eccentricity spectrum of the line graphs of starlike trees and compute their eccentric energy. Furthermore, we establish that the eccentricity matrix of the line graph of any starlike tree is irreducible.
S. Balamoorthy +4 more
wiley +1 more source
Graphs With All But Two Eigenvalues In [−2, 0]
Discussiones Mathematicae Graph Theory, 2020 The eigenvalues of a graph are those of its adjacency matrix. Recently, Cioabă, Haemers and Vermette characterized all graphs with all but two eigenvalues equal to −2 and 0.
Abreu Nair +4 more
doaj +1 more source
Some Properties of the Eigenvalues of the Net Laplacian Matrix of a Signed Graph
Discussiones Mathematicae Graph Theory, 2022 Given a signed graph Ġ, let AĠ and DG˙±D_{\dot G}^ \pm denote its standard adjacency matrix and the diagonal matrix of vertex net-degrees, respectively. The net Laplacian matrix of Ġ is defined to be NG˙=DG˙±-AG˙{N_{\dot G}} = D_{\dot G}^ \pm - {A_{\dot
Stanić Zoran
doaj +1 more source
Prime Graphs of Polynomials and Power Series Over Noncommutative Rings
International Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.The prime graph PG(R) of a ring R is a graph whose vertex set consists of all elements of R. Two elements x, y ∈ R are adjacent in the graph if and only if xRy = 0 or yRx = 0. An element a ∈ R is called a strong zero divisor in R if 〈a〉〈b〉 = 0 or 〈b〉〈a〉 = 0 for some nonzero element b ∈ R. The set of all strong zero divisors is denoted by S(R).
Walaa Obaidallah Alqarafi +3 more
wiley +1 more source
Turán’s Theorem Implies Stanley’s Bound
Discussiones Mathematicae Graph Theory, 2020 Let G be a graph with m edges and let ρ be the largest eigenvalue of its adjacency matrix.
Nikiforov V.
doaj +1 more source
On the Maximum SC Index of Chemical Unicyclic Graphs
Journal of Mathematics, Volume 2025, Issue 1, 2025.The sum‐connectivity (SC) index of a graph G is defined as SCG=∑μν∈EG1/Θμ+Θν, where Θμ denotes the vertex degree of μ in G. In this paper, the fourth largest value of SC index for the chemical unicyclic graphs of order n ≥ 7 is determined.
Hui-Yan Cheng +3 more
wiley +1 more source
Open problems on graph eigenvalues studied with AutoGraphiX
EURO Journal on Computational Optimization, 2013 Since the late forties of the last century, methods of operations research have been extensively used to solve problems in graph theory, and graph theory has been extensively used to model operations research problems and to solve optimization problems ...
Mustapha Aouchiche +2 more
doaj +1 more source