Results 11 to 20 of about 14,713,178 (309)

A G matrix analogue to capture the cumulative effects of nongenetic inheritance [PDF]

open access: yesJournal of Evolutionary Biology, 2013
The genetic variance-covariance (G) matrix describes the variances and covariances of genetic traits under strict genetic inheritance. Genetically expressed traits often influence trait expression in another via nongenetic forms of transmission and ...
Townley, S., Ezard, T. H. G.
core   +4 more sources

Understanding the evolution and stability of the G-matrix. [PDF]

open access: yesEvolution, 2008
The G-matrix summarizes the inheritance of multiple, phenotypic traits. The stability and evolution of this matrix are important issues because they affect our ability to predict how the phenotypic traits evolve by selection and drift. Despite the centrality of these issues, comparative, experimental, and analytical approaches to understanding the ...
Arnold SJ   +4 more
europepmc   +5 more sources

The G-matrix Simulator Family: Software for Research and Teaching. [PDF]

open access: yesJ Hered, 2018
Genetic variation plays a fundamental role in all models of evolution. For phenotypes composed of multiple quantitative traits, genetic variation is best quantified as additive genetic variances and covariances, as these values determine the rate and trajectory of evolution.
Jones AG, Bürger R, Arnold SJ.
europepmc   +5 more sources

CHARACTERIZATION OF JORDAN $\{g, h\}$-DERIVATIONS OVER MATRIX ALGEBRAS [PDF]

open access: yesJournal 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]

open access: yesJournal 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]

open access: yesHydrology 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

Transcriptomic Profile Reveals Deregulation of Hearing-Loss Related Genes in Vestibular Schwannoma Cells Following Electromagnetic Field Exposure

open access: yesCells, 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

open access: yesSpecial 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

open access: yesFuzzy 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]

open access: yesTransactions 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

Home - About - Disclaimer - Privacy