Results 61 to 70 of about 601,789 (263)
The Least Distance Eigenvalue of Complement Graphs with Two Pendant Vertices
MathematicsLet G be a connected simple graph with the vertex set V(G)={v1,v2,…,vn}, where the distance dG(vi,vj) is the length of a shortest path between vi and vj, and the distance matrix D(G)=(dij)n×n is defined by dij=dG(vi,vj).
Jinfeng Zhang +5 more
doaj +1 more source
On the Distance Spectral Radius of Trees with Given Degree Sequence
Discussiones Mathematicae Graph Theory, 2020 We consider the problem of maximizing the distance spectral radius and a slight generalization thereof among all trees with some prescribed degree sequence.
Dadedzi Kenneth +2 more
doaj +1 more source
Distance to the nearest stable Metzler matrix
2017 IEEE 56th Annual Conference on Decision and Control (CDC), 2017 This paper considers the non-convex problem of finding the nearest Metzler matrix to a given possibly unstable matrix. Linear systems whose state vector evolves according to a Metzler matrix have many desirable properties in analysis and control with regard to scalability.
openaire +5 more sources
Four-point condition matrices of edge-weighted trees
Special MatricesFormulas for the determinant of distance matrix DT{D}_{T} of tree TT are known in the unweighted case and in the case when the edges of TT have commuting variable weights. Associated with the four-point condition (4PC) and a tree TT are two matrices, the
Azimi Ali +3 more
doaj +1 more source
Molecular Oncology, EarlyView.Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source
The second immanant of some combinatorial matrices [PDF]
Transactions on Combinatorics, 2015 Let $A = (a_{i,j})_{1 leq i,j leq n}$ be an $n times n$ matrix where $n geq 2$. Let $dt(A)$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$.
R. B. Bapat +1 more
doaj
Extremal Unicyclic Graphs With Minimal Distance Spectral Radius
Discussiones Mathematicae Graph Theory, 2014 The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Let U (n,m) be the class of unicyclic graphs of order n with given matching number m (m ≠ 3).
Lu Hongyan, Luo Jing, Zhu Zhongxun
doaj +1 more source
K-Matrix: A Novel Change-Pattern Mining Method for SAR Image Time Series
Remote Sensing, 2019 In this paper, we present a novel method for change-pattern mining in Synthetic Aperture Radar (SAR) image time series based on a distance matrix clustering algorithm, called K-Matrix.
Dong Peng +3 more
doaj +1 more source
Cancer‐associated mutations in endometriosis reframe a benign disease through molecular oncology
Molecular Oncology, EarlyView.This review aims to comprehensively analyse cancer‐associated somatic mutations (CAMs) present in endometriotic lesions, emphasizing their biological roles, spatial distribution and implications for translational applications in medicine. By contextualizing a benign state within a genomic framework, this analysis seeks to establish its value as a ...
Clarissa Mujacic +15 more
wiley +1 more source
EAI Endorsed Transactions on Context-aware Systems and Applications, 2016 In recent years, the research cluster of objective interestingness measures has rapidly developed in order to assist users to choose the appropriate measure for their application.
Nghia Quoc Phan +3 more
doaj +1 more source