Results 1 to 10 of about 14,685,243 (263)
CHARACTERIZATION OF JORDAN $\{g, h\}$-DERIVATIONS OVER MATRIX ALGEBRAS [PDF]
Journal of Algebraic Systems, 2023 In this article, we characterize $\{g, h\}$-derivation on the upper triangular matrix algebra $\mathcal{T}_n(C)$ and prove that every Jordan $\{g, h\}$-derivation over $\mathcal{T}_n(C)$ is a $\{g, h\}$-derivation under a certain condition, where $C$ is ...
Arindam Ghosh, Om Prakash
doaj +1 more source
NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS [PDF]
Journal of Algebraic Systems, 2021 The distance signless Laplacian spectral radius of a connected graph $G$ is the largest eigenvalue of the distance signless Laplacian matrix of $G$, defined as $D^{Q}(G)=Tr(G)+D(G)$, where $D(G)$ is the distance matrix of $G$ and $Tr(G)$ is the diagonal ...
A. Alhevaz, M. Baghipur, S. Paul
doaj +1 more source
Spatial and temporal variability of groundwater recharge in a sandstone aquifer in a semiarid region [PDF]
Hydrology and Earth System Sciences, 2019 With the aim to understand the spatial and temporal variability of groundwater recharge, a high-resolution, spatially distributed numerical model (MIKE SHE) representing surface water and groundwater was used to simulate responses to precipitation in a 2.
F. Manna +6 more
doaj +1 more source
Cells, 2021 Hearing loss (HL) is the most common sensory disorder in the world population. One common cause of HL is the presence of vestibular schwannoma (VS), a benign tumor of the VIII cranial nerve, arising from Schwann cell (SC) transformation.
Alessandra Colciago +9 more
doaj +1 more source
Two n × n G-classes of matrices having finite intersection
Special Matrices, 2022 Let Mn{{\bf{M}}}_{n} be the set of all n×nn\times n real matrices. A nonsingular matrix A∈MnA\in {{\bf{M}}}_{n} is called a G-matrix if there exist nonsingular diagonal matrices D1{D}_{1} and D2{D}_{2} such that A−T=D1AD2{A}^{-T}={D}_{1}A{D}_{2}.
Golshan Setareh +2 more
doaj +1 more source
On the Signless Laplacian Eigenvalues and Optimum SLE of Graph
Fuzzy Optimization and Modeling, 2022 Let G be a graph of order n and with the vertex set {v_1,v_2,…,v_n } and the edge set E(G). The adjancency matrix of G is an n×n matrix A(G) whose (i,j)-entry is 1 if v_i is adjacent to v_j and 0, otherwise.
Gholam Hossein Fath-Tabar
doaj +1 more source
Chromatic number and signless Laplacian spectral radius of graphs [PDF]
Transactions on Combinatorics, 2022 For any simple graph $G$, the signless Laplacian matrix of $G$ is defined as $D(G)+A(G)$, where $D(G)$ and $A(G)$ are the diagonal matrix of vertex degrees and the adjacency matrix of $G$, respectively.
Mohammad Reza Oboudi
doaj +1 more source
The spectral radius of signless Laplacian matrix and sum-connectivity index of graphs
AKCE International Journal of Graphs and Combinatorics, 2022 The sum-connectivity index of a graph G is defined as the sum of weights [Formula: see text] over all edges uv of G, where du and dv are the degrees of the vertices u and v in G, respectively.
A. Jahanbani, S. M. Sheikholeslami
doaj +1 more source
On Laplacian resolvent energy of graphs [PDF]
Transactions on Combinatorics, 2023 Let $G$ be a simple connected graph of order $n$ and size $m$. The matrix $L(G)=D(G)-A(G)$ is the Laplacian matrix of $G$, where $D(G)$ and $A(G)$ are the degree diagonal matrix and the adjacency matrix, respectively. For the graph $G$, let $d_{1}\geq d_{
Sandeep Bhatnagar +2 more
doaj +1 more source
The normalized distance Laplacian
Special Matrices, 2021 The distance matrix 𝒟(G) of a connected graph G is the matrix containing the pairwise distances between vertices. The transmission of a vertex vi in G is the sum of the distances from vi to all other vertices and T(G) is the diagonal matrix of ...
Reinhart Carolyn
doaj +1 more source