Results 61 to 70 of about 113,956 (308)
The k-adjacency operators and adjacency Jacobi matrix on distance-regular graphs
We deal in this work with a class of graphs, namely, the class of distance-regular graphs, in which on the basis of $k$-adjacency operators, the adjacency operator $A$ of a distance-regular graph is identified as a Jacobi matrix. To get so, the set of the $k$-adjacency operators is recognized as a canonical basis in a certain Hilbert space, where the ...
openaire +2 more sources
Exploration of heterogeneity and recurrence signatures in hepatocellular carcinoma
This study leveraged public datasets and integrative bioinformatic analysis to dissect malignant cell heterogeneity between relapsed and primary HCC, focusing on intercellular communication, differentiation status, metabolic activity, and transcriptomic profiles.
Wen‐Jing Wu+15 more
wiley +1 more source
Reducing Rank of the Adjacency Matrix by Graph Modification
The main topic of this article is to study a class of graph modification problems. A typical graph modification problem takes as input a graph G, a positive integer k and the objective is to add/delete k vertices (edges) so that the resulting graph belongs to a particular family, \(\mathcal F\), of graphs.
S.M. Meesum+2 more
openaire +3 more sources
The graphs with all but two eigenvalues equal to $-2$ or $0$
We determine all graphs for which the adjacency matrix has at most two eigenvalues (multiplicities included) not equal to $-2$, or $0$, and determine which of these graphs are determined by their adjacency ...
Cioaba, Sebastian M.+2 more
core +1 more source
This study used longitudinal transcriptomics and gene‐pattern classification to uncover patient‐specific mechanisms of chemotherapy resistance in breast cancer. Findings reveal preexisting drug‐tolerant states in primary tumors and diverse gene rewiring patterns across patients, converging on a few dysregulated functional modules. Despite receiving the
Maya Dadiani+14 more
wiley +1 more source
Moment-Based Spectral Analysis of Large-Scale Generalized Random Graphs
This paper investigates the spectra of the adjacency matrix and Laplacian matrix for an artificial complex network model-the generalized random graph. We deduce explicit expressions for the first four asymptotic spectral moments of the adjacency matrix ...
Qun Liu, Zhishan Dong, En Wang
doaj +1 more source
Spatial‐temporal slowfast graph convolutional network for skeleton‐based action recognition
In skeleton‐based action recognition, the graph convolutional network (GCN) has achieved great success. Modelling skeleton data in a suitable spatial‐temporal way and designing the adjacency matrix are crucial aspects for GCN‐based methods to capture ...
Zheng Fang+4 more
doaj +1 more source
Genomics‐led approach to drug testing in models of undifferentiated pleomorphic sarcoma
GA text Genomic data from undifferentiated pleomorphic sarcoma patients and preclinical models were used to inform a targeted drug screen. Selected compounds were tested in 2D and 3D cultures of UPS cell lines. A combination of trametinib and infigratinib was synergistic in the majority of UPS cell lines tested, which was further confirmed in an ex ...
Piotr J. Manasterski+19 more
wiley +1 more source
Minimum eigenvalue of the complement of tricyclic graphs with n-4 pendent vertexes
In order to discuss the minimum eigenvalue of adjacency matrix in the class of complementary graphs of the tricyclic graph with a given order of n and n-4 pendent vertexes, the unique graph whose minimum eigenvalue reaches the minimum is characterized ...
Hongjuan JU, Yingjie LEI
doaj +1 more source
Laplacian versus Adjacency Matrix in Quantum Walk Search
A quantum particle evolving by Schr\"odinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator.
Nahimov, Nikolay+2 more
core +1 more source