Results 41 to 50 of about 2,494 (128)
More on the minimum skew-rank of graphs
, 2015 The minimum (maximum) skew-rank of a simple graph G over real field is the smallest (largest) possible rank among all skew-symmetric matrices over real field whose i j -th entry is nonzero whenever viv j is an edge in G and is zero otherwise.
Hui Qu, Guihai Yu, Linhua Feng
semanticscholar +1 more source
Potential counter-examples to a conjecture on the column space of the adjacency matrix
Special MatricesAttempts to resolve the Akbari-Cameron-Khosrovshahi-conjecture have so far focused on the rank of a matrix. The conjecture claims that there exists a nonzero (0, 1)-vector in the row space of a (0, 1)-adjacency matrix A{\bf{A}} of a graph GG, that is not
Sciriha Irene +3 more
doaj +1 more source
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
The minimum exponential atom-bond connectivity energy of trees
Special MatricesLet G=(V(G),E(G))G=\left(V\left(G),E\left(G)) be a graph of order nn. The exponential atom-bond connectivity matrix AeABC(G){A}_{{e}^{{\rm{ABC}}}}\left(G) of GG is an n×nn\times n matrix whose (i,j)\left(i,j)-entry is equal to ed(vi)+d(vj)−2d(vi)d(vj){e}^
Gao Wei
doaj +1 more source
Further results regarding the degree Kirchhoff index of graphs
, 2014 Let G be a connected graph with vertex set V.G/. The degree Kirchhoff index of G is defined as S .G/D P fu;vg V.G/ d.u/d.v/R.u;v/, where d.u/ is the degree of vertex u, and R.u;v/ denotes the resistance distance between vertices u and v. In this paper we
Lihua Feng, Guihai Yu, Weijun Liu
semanticscholar +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