Results 71 to 80 of about 4,837,596 (345)
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
Karpatsʹkì Matematičnì Publìkacìï, 2022 If $Tr(G)$ and $D(G)$ are respectively the diagonal matrix of vertex transmission degrees and distance matrix of a connected graph $G$, the generalized distance matrix $D_{\alpha}(G)$ is defined as $D_{\alpha}(G)=\alpha ~Tr(G)+(1-\alpha)~D(G)$, where $0 ...
M. Merajuddin, S. Bhatnagar, S. Pirzada
doaj +1 more source
Strength through diversity: how cancers thrive when clones cooperate
Molecular Oncology, EarlyView.Intratumor heterogeneity can offer direct benefits to the tumor through cooperation between different clones. In this review, Kuiken et al. discuss existing evidence for clonal cooperativity to identify overarching principles, and highlight how novel technological developments could address remaining open questions.
Marije C. Kuiken +3 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
Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-Rank Matrix Completion [PDF]
IEEE Transactions on Information Theory, 2018 The Euclidean distance geometry problem arises in a wide variety of applications, from determining molecular conformations in computational chemistry to localization in sensor networks.
Abiy Tasissa, Rongjie Lai
semanticscholar +1 more source
Potential therapeutic targeting of BKCa channels in glioblastoma treatment
Molecular Oncology, EarlyView.This review summarizes current insights into the role of BKCa and mitoBKCa channels in glioblastoma biology, their potential classification as oncochannels, and the emerging pharmacological strategies targeting these channels, emphasizing the translational challenges in developing BKCa‐directed therapies for glioblastoma treatment.
Kamila Maliszewska‐Olejniczak +4 more
wiley +1 more source
Distance matrix polynomials of trees
Advances in Mathematics, 1978 AbstractLet G be a finite connected graph. If x and y are vertices of G, one may define a distance function dG on G by letting dG(x, y) be the minimal length of any path between x and y in G (with dG(x, x) = 0). Thus, for example, dG(x, y) = 1 if and only if {x, y} is an edge of G.
Graham, R.L, Lovász, L
openaire +2 more sources
CRITICAL POINTS OF MATRIX LEAST SQUARE DISTANCE FUNCTIONS [PDF]
Linear Algebra and its Applications, 1992 The authors determine the critical points and the local minimum of the Frobenius distance function \(\| A - X \|^ 2\) on varieties of fixed rank symmetric, skew-symmetric, and rectangular matrices \(X\).
Helmke, Uwe, Shayman, Mark A.
openaire +1 more source