Results 31 to 40 of about 279 (161)
Graphs With All But Two Eigenvalues In [−2, 0]
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
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
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
A Lower Bound for the Spectral Radius of Graphs with Fixed Diameter [PDF]
AMS classifications: 05C50 ...
Koolen, J.H. +3 more
core +1 more source
Graphs whose Laplacian eigenvalues are almost all 1 or 2
We explicitly determine all connected graphs whose Laplacian matrices have at most four eigenvalues different from 1 and 2.
Mohammadian Ali, Xu Shanshan
doaj +1 more source
Turán’s Theorem Implies Stanley’s Bound
Let G be a graph with m edges and let ρ be the largest eigenvalue of its adjacency matrix.
Nikiforov V.
doaj +1 more source
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
Open problems on graph eigenvalues studied with AutoGraphiX
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
On Singular Signed Graphs with Nullspace Spanned by a Full Vector: Signed Nut Graphs
A signed graph has edge weights drawn from the set {+1, −1}, and is sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is sign-unbalanced.
Bašić Nino +3 more
doaj +1 more source
On the Eccentric Spectra of the Line Graph of Starlike Trees
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

