Results 31 to 40 of about 2,530 (150)
Rank relations between a {0, 1}-matrix and its complement
Open Mathematics, 2018 Let A be a {0, 1}-matrix and r(A) denotes its rank. The complement matrix of A is defined and denoted by Ac = J − A, where J is the matrix with each entry being 1.
Ma Chao, Zhong Jin
doaj +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
Journal of Mathematics, Volume 2026, Issue 1, 2026.The polygonized graph Pn,k(G) is constructed from a simple connected graph G through a substitution process. During this process, each edge in G is replaced by one path of length 1 and k paths of length +1(n, k ≥ 1). Based on the properties of the determinants of tridiagonal matrices, we present a unified formula for computing the normalized Laplacian ...
Hao Li +3 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
Construction of Albertson Cospectral and Albertson Equienergetic Graphs Using Graph Operations
Journal of Mathematics, Volume 2026, Issue 1, 2026.The energy of a graph is an invariant calculated as the sum of the absolute eigenvalues of its adjacency matrix. This concept extends to various types of energies derived from different graph‐related matrices. This paper explores the spectral properties of Albertson energy and Albertson spectra.
Jane Shonon Cutinha +3 more
wiley +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
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
Some inequalities on the skew-spectral radii of oriented graphs
, 2012 Let G be a simple graph and Gσ be an oriented graph obtained from G by assigning a direction to each edge of G. The adjacency matrix of G is A(G) and the skew-adjacency matrix of Gσ is S(Gσ).
Guang-Hui Xu
semanticscholar +1 more source
On First Hermitian-Zagreb Matrix and Hermitian-Zagreb Energy
International Journal of Scientific Research in Mathematical and Statistical Sciences, 2018 A mixed graph is a graph with edges and arcs, which can be considered as a combination of an undirected graph and a directed graph. In this paper we propose a Hermitian matrix for mixed graphs which is a modified version of the classical adjacency matrix
A. Bharali
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