Results 51 to 60 of about 121,408 (279)

Minimum eigenvalue of the complement of tricyclic graphs with n-4 pendent vertexes

open access: yesJournal of Hebei University of Science and Technology, 2019
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

Spatial‐temporal slowfast graph convolutional network for skeleton‐based action recognition

open access: yesIET Computer Vision, 2022
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

Transcriptional network analysis of PTEN‐protein‐deficient prostate tumors reveals robust stromal reprogramming and signs of senescent paracrine communication

open access: yesMolecular Oncology, EarlyView.
Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice   +16 more
wiley   +1 more source

Interval Valued Secondary k-Range Symmetric Quadri Partitioned Neutrosophic Fuzzy Matrices with Decision Making [PDF]

open access: yesNeutrosophic Sets and Systems
The objective of this study is to establish the results concerning Interval-Valued (IV) Secondary k-Range Symmetric (RS) Quadri Partitioned Neutrosophic Fuzzy Matrices (QPNFM).
K. Radhika   +5 more
doaj   +1 more source

EEG-Based Emotion Recognition Using Regularized Graph Neural Networks

open access: yes, 2020
Electroencephalography (EEG) measures the neuronal activities in different brain regions via electrodes. Many existing studies on EEG-based emotion recognition do not fully exploit the topology of EEG channels.
Miao, Chunyan, Wang, Di, Zhong, Peixiang
core   +1 more source

Crucial parameters for precise copy number variation detection in formalin‐fixed paraffin‐embedded solid cancer samples

open access: yesMolecular Oncology, EarlyView.
This study shows that copy number variations (CNVs) can be reliably detected in formalin‐fixed paraffin‐embedded (FFPE) solid cancer samples using ultra‐low‐pass whole‐genome sequencing, provided that key (pre)‐analytical parameters are optimized.
Hanne Goris   +10 more
wiley   +1 more source

On the second minimizing graph in the set of complements of trees

open access: yesAKCE International Journal of Graphs and Combinatorics, 2019
Let G be a graph of order n and A(G)=[ai,j]be its adjacency matrix such that ai,j=1 if viis adjacent to vjand ai,j=0 otherwise, where 1≤i,j≤n. In a certain family of graphs, a graph is called minimizing (or second minimizing) if the least eigenvalue of ...
M. Javaid
doaj   +1 more source

Hierarchical data structures for flowchart

open access: yesScientific Reports, 2023
Flowcharts have broad applications in the fields of software development, engineering design, and scientific experimentation. Current flowchart data structure is mainly based on the adjacency list, cross-linked list, and adjacency matrix of the graph ...
Peng Zhang, Wenzhang Dou, Huaping Liu
doaj   +1 more source

Hua's fundamental theorem of geometry of rectangular matrices over EAS division rings

open access: yes, 2015
The fundamental theorem of geometry of rectangular matrices describes the general form of bijective maps on the space of all $m\times n$ matrices over a division ring $\mathbb{D}$ which preserve adjacency in both directions.
Pazzis, Clément de Seguins   +1 more
core   +2 more sources

Spectral radii of sparse random matrices

open access: yes, 2020
We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\'enyi graphs. Our error bounds are sharp for a large class of sparse random matrices. In particular,
Benaych-Georges, Florent   +2 more
core   +3 more sources

Home - About - Disclaimer - Privacy